Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers

byEvripidis BampisEditorKlaus Jansen

Paperback | April 23, 2010

Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers by Evripidis Bampis
$140.95
Earn 705 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

2009.
Title:Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Copenhagen, Denmark, Se...Format:PaperbackProduct dimensions:255 pages, 0 X 0 X 0 inShipping dimensions:255 pages, 0 X 0 X 0 inPublished:April 23, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642124496

ISBN - 13:9783642124495

Appropriate for ages: All ages

Look for similar items by category:

Table of Contents

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.