Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings

Gespeichert in:

Personen und Körperschaften:	Lee, Der-Tsai (VerfasserIn), Chen, Danny Z. (Sonstige), Ying, Shi (Sonstige)
Titel:	Frontiers in Algorithmics: 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010. Proceedings/ edited by Der-Tsai Lee, Danny Z. Chen, Shi Ying
Format:	E-Book Konferenzbericht
Sprache:	Englisch
veröffentlicht:	Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme:	SpringerLink Lecture notes in computer science ; 6213
Schlagwörter:	Information theory Computer software Logic design Computational complexity Computer science Software engineering Computer Science Algorithms. Discrete mathematics. Computer programming. Konferenzschrift > 2010 > Wuhan
Buchausg. u.d.T.:	Frontiers in algorithmics, Berlin : Springer, 2010, XI, 338 S.
Quelle:	Verbunddaten SWB
Zugangsinformationen:	Elektronischer Volltext - Campuslizenz

Details
Zusammenfassung:	Progress on Certifying Algorithms -- Computational Geometry for Uncertain Data -- On Foundations of Services Interoperation in Cloud Computing -- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets -- Truthful Auction for CPU Time Slots -- Top-d Rank Aggregation in Web Meta-search Engine -- Minimum Common String Partition Revisited -- Inapproximability of Maximal Strip Recovery: II -- Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximation Schemes for Scheduling with Availability Constraints -- An Space Lower Bound for Finding ?-Approximate Quantiles in a Data Stream -- Improved Sublinear Time Algorithm for Width-Bounded Separators -- Constant Time Generation of Biconnected Rooted Plane Graphs -- Solving General Lattice Puzzles -- A Hybrid Graph Representation for Recursive Backtracking Algorithms -- On Tractable Exponential Sums -- Recognizing d-Interval Graphs and d-Track Interval Graphs -- Categorial Semantics of a Solution to Distributed Dining Philosophers Problem -- Approximation Algorithms for the Capacitated Domination Problem -- A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle -- FPTAS’s for Some Cut Problems in Weighted Trees -- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks -- Online Algorithms for the Newsvendor Problem with and without Censored Demands -- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems -- Path Separability of Graphs -- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings -- Computing Minimum Diameter Color-Spanning Sets -- Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares -- Optimum Sweeps of Simple Polygons with Two Guards -- Adaptive Algorithms for Planar Convex Hull Problems -- New Algorithms for Barrier Coverage with Mobile Sensors.
Umfang:	Online-Ressource (XI, 339p. 74 illus, digital)
ISBN:	9783642145537
DOI:	10.1007/978-3-642-14553-7