LEADER 03885nam  2200577 a 450 
001 9910484983903321
005 20200520144314.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   $a20100615d2010      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFrontiers in algorithmics $e4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010 : proceedings /$fDer-Tsai Lee, Danny Z. Chen, Shi Ying, (eds.)
205   $a1st ed.
210   $aBerlin $cSpringer$d2010
215   $a1 online resource (XI, 339 p. 74 illus.) 
225 1 $aLecture notes in computer science,$x0302-9743 ;$v6213
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
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$aLecture notes in computer science ;$v6213.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
606   $aComputer algorithms$vCongresses
615  0$aComputer algorithms
676   $a005.1
701   $aLee$b Der-Tsai$01750602
701   $aChen$b Danny Z$01750603
701   $aYing$b Shi$01750604
712 12$aFAW 2010
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910484983903321
996   $aFrontiers in algorithmics$94185262
997   $aUNINA