LEADER 04362nam  22007815  450 
001 996465599003316
005 20230406071833.0
010   $a3-540-69514-1
024 7 $a10.1007/11970125
035   $a(CKB)1000000000284062
035   $a(SSID)ssj0000316304
035   $a(PQKBManifestationID)11285834
035   $a(PQKBTitleCode)TC0000316304
035   $a(PQKBWorkID)10263929
035   $a(PQKB)11423522
035   $a(DE-He213)978-3-540-69514-1
035   $a(MiAaPQ)EBC3068671
035   $a(PPN)123159547
035   $a(EXLCZ)991000000000284062
100   $a20110117d2007      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aApproximation and Online Algorithms$b[electronic resource] $e4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers /$fedited by Thomas Erlebach, Christos Kaklamanis
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (X, 346 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4368
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-69513-3 
320   $aIncludes bibliographical references and index.
327   $aApproximation Algorithms for Scheduling Problems with Exact Delays -- Bidding to the Top: VCG and Equilibria of Position-Based Auctions -- Coping with Interference: From Maximum Coverage to Planning Cellular Networks -- Online Dynamic Programming Speedups -- Covering Many or Few Points with Unit Disks -- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems -- Online k-Server Routing Problems -- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem -- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs -- A Randomized Algorithm for Online Unit Clustering -- On Hierarchical Diameter-Clustering, and the Supplier Problem -- Bin Packing with Rejection Revisited -- On Bin Packing with Conflicts -- Approximate Distance Queries in Disk Graphs -- Network Design with Edge-Connectivity and Degree Constraints -- Approximating Maximum Cut with Limited Unbalance -- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems -- Improved Online Hypercube Packing -- Competitive Online Multicommodity Routing -- The k-Allocation Problem and Its Variants -- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions -- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set -- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search -- Approximation Algorithms for Multi-criteria Traveling Salesman Problems -- The Survival of the Weakest in Networks -- Online Distributed Object Migration.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4368
606   $aSoftware engineering
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aComputer graphics
606   $aArtificial intelligence?Data processing
606   $aSoftware Engineering
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
606   $aComputer Graphics
606   $aData Science
615  0$aSoftware engineering.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615  0$aComputer graphics.
615  0$aArtificial intelligence?Data processing.
615 14$aSoftware Engineering.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
615 24$aComputer Graphics.
615 24$aData Science.
676   $a005.1
702   $aErlebach$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKaklamanis$b Christos$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465599003316
996   $aApproximation and Online Algorithms$92954916
997   $aUNISA