04344nam 22008295 450 99646591990331620230220094439.01-280-38624-X97866135641603-642-12450-X10.1007/978-3-642-12450-1(CKB)2550000000011525(SSID)ssj0000399470(PQKBManifestationID)11250024(PQKBTitleCode)TC0000399470(PQKBWorkID)10375777(PQKB)10191760(DE-He213)978-3-642-12450-1(MiAaPQ)EBC3065267(OCoLC)ocn646812614(DLC) 2010924119(PPN)149073348(EXLCZ)99255000000001152520100509d2010 u| 0engurnn|008mamaatxtccrApproximation and Online Algorithms[electronic resource] 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers /edited by Evripidis Bampis, Klaus Jansen1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (X, 255 p. 23 illus.) Theoretical Computer Science and General Issues,2512-2029 ;5893International conference proceedings.3-642-12449-6 Includes bibliographical references and index.WAOA 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.Theoretical Computer Science and General Issues,2512-2029 ;5893Computer programmingComputer scienceApplication softwareAlgorithmsComputer science—MathematicsDiscrete mathematicsNumerical analysisProgramming TechniquesTheory of ComputationComputer and Information Systems ApplicationsAlgorithmsDiscrete Mathematics in Computer ScienceNumerical AnalysisComputer programming.Computer science.Application software.Algorithms.Computer science—Mathematics.Discrete mathematics.Numerical analysis.Programming Techniques.Theory of Computation.Computer and Information Systems Applications.Algorithms.Discrete Mathematics in Computer Science.Numerical Analysis.005.11Bampis Evripidisedthttp://id.loc.gov/vocabulary/relators/edtJansen Klausedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465919903316Approximation and Online Algorithms2954916UNISA