LEADER 04690nam 22007575 450 001 996466428303316 005 20230221124747.0 010 $a3-642-14553-1 024 7 $a10.1007/978-3-642-14553-7 035 $a(CKB)2670000000036339 035 $a(SSID)ssj0000446482 035 $a(PQKBManifestationID)11923934 035 $a(PQKBTitleCode)TC0000446482 035 $a(PQKBWorkID)10496161 035 $a(PQKB)10210516 035 $a(DE-He213)978-3-642-14553-7 035 $a(MiAaPQ)EBC3065590 035 $a(PPN)149018304 035 $a(EXLCZ)992670000000036339 100 $a20100726d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFrontiers in Algorithms$b[electronic resource] $e4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010, Proceedings /$fedited by D.T. Lee, Danny Z Chen, Shi Ying 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 339 p. 74 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6213 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14552-3 320 $aIncludes bibliographical references and index. 327 $aProgress 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6213 606 $aAlgorithms 606 $aComputer programming 606 $aSoftware engineering 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aAlgorithms 606 $aProgramming Techniques 606 $aSoftware Engineering 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Science Logic and Foundations of Programming 615 0$aAlgorithms. 615 0$aComputer programming. 615 0$aSoftware engineering. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 14$aAlgorithms. 615 24$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Science Logic and Foundations of Programming. 676 $a005.1 702 $aLee$b D.T$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aChen$b Danny Z$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aYing$b Shi$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aFAW 2010 906 $aBOOK 912 $a996466428303316 996 $aFrontiers in Algorithms$92595066 997 $aUNISA