Frontiers in algorithmics : 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010 : proceedings / / Der-Tsai Lee, Danny Z. Chen, Shi Ying, (eds.)

• Pubblicazione: Berlin, : Springer, 2010
• Edizione: 1st ed.
• Descrizione fisica: 1 online resource (XI, 339 p. 74 illus.)
• Disciplina: 005.1
• Soggetto topico: Computer algorithms
• Altri autori: LeeDer-Tsai ChenDanny Z YingShi
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Titolo autorizzato: Frontiers in algorithmics
• ISBN: 3-642-14553-1
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910484983903321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture notes in computer science ; ; 6213.; LNCS sublibrary. : SL 1, . -Theoretical computer science and general issues.