04690nam 22007575 450 99646642830331620230221124747.03-642-14553-110.1007/978-3-642-14553-7(CKB)2670000000036339(SSID)ssj0000446482(PQKBManifestationID)11923934(PQKBTitleCode)TC0000446482(PQKBWorkID)10496161(PQKB)10210516(DE-He213)978-3-642-14553-7(MiAaPQ)EBC3065590(PPN)149018304(EXLCZ)99267000000003633920100726d2010 u| 0engurnn|008mamaatxtccrFrontiers in Algorithms[electronic resource] 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings /edited by D.T. Lee, Danny Z Chen, Shi Ying1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XI, 339 p. 74 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6213Bibliographic Level Mode of Issuance: Monograph3-642-14552-3 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;6213AlgorithmsComputer programmingSoftware engineeringComputer science—MathematicsDiscrete mathematicsComputer scienceAlgorithmsProgramming TechniquesSoftware EngineeringDiscrete Mathematics in Computer ScienceComputer Science Logic and Foundations of ProgrammingAlgorithms.Computer programming.Software engineering.Computer science—Mathematics.Discrete mathematics.Computer science.Algorithms.Programming Techniques.Software Engineering.Discrete Mathematics in Computer Science.Computer Science Logic and Foundations of Programming.005.1Lee D.Tedthttp://id.loc.gov/vocabulary/relators/edtChen Danny Zedthttp://id.loc.gov/vocabulary/relators/edtYing Shiedthttp://id.loc.gov/vocabulary/relators/edtFAW 2010BOOK996466428303316Frontiers in Algorithms2595066UNISA