LEADER 04344nam  22008295  450 
001 996465919903316
005 20230220094439.0
010   $a1-280-38624-X
010   $a9786613564160
010   $a3-642-12450-X
024 7 $a10.1007/978-3-642-12450-1
035   $a(CKB)2550000000011525
035   $a(SSID)ssj0000399470
035   $a(PQKBManifestationID)11250024
035   $a(PQKBTitleCode)TC0000399470
035   $a(PQKBWorkID)10375777
035   $a(PQKB)10191760
035   $a(DE-He213)978-3-642-12450-1
035   $a(MiAaPQ)EBC3065267
035   $a(OCoLC)ocn646812614
035   $a(DLC)  2010924119
035   $a(PPN)149073348
035   $a(EXLCZ)992550000000011525
100   $a20100509d2010      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aApproximation and Online Algorithms$b[electronic resource] $e7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers /$fedited by Evripidis Bampis, Klaus Jansen
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (X, 255 p. 23 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5893
300   $aInternational conference proceedings.
311   $a3-642-12449-6 
320   $aIncludes bibliographical references and index.
327   $aWAOA 2009 -- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems -- Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications -- Price Fluctuations: To Buy or to Rent -- Approximation Algorithms for Multiple Strip Packing -- Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window -- Longest Wait First for Broadcast Scheduling [Extended Abstract] -- The Routing Open Shop Problem: New Approximation Algorithms -- On the Price of Stability for Undirected Network Design -- Finding Dense Subgraphs in G(n,1/2) -- Parameterized Analysis of Paging and List Update Algorithms -- Online Scheduling of Bounded Length Jobs to Maximize Throughput -- On the Additive Constant of the k-Server Work Function Algorithm -- A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs -- Guard Games on Graphs: Keep the Intruder Out! -- Between a Rock and a Hard Place: The Two-to-One Assignment Problem -- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width -- Online Minimization Knapsack Problem -- Optimization Problems in Multiple Subtree Graphs -- Multi-Criteria TSP: Min and Max Combined -- Packet Routing: Complexity and Algorithms -- Minimal Cost Reconfiguration of Data Placement in Storage Area Network -- Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5893
606   $aComputer programming
606   $aComputer science
606   $aApplication software
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aProgramming Techniques
606   $aTheory of Computation
606   $aComputer and Information Systems Applications
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
615  0$aComputer programming.
615  0$aComputer science.
615  0$aApplication software.
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615 14$aProgramming Techniques.
615 24$aTheory of Computation.
615 24$aComputer and Information Systems Applications.
615 24$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
676   $a005.11
702   $aBampis$b Evripidis$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465919903316
996   $aApproximation and Online Algorithms$92954916
997   $aUNISA