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

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

by Evripidis Bampis
     
 

ISBN-10: 3642124496

ISBN-13: 9783642124495

Pub. Date: 04/23/2010

Publisher: Springer Berlin Heidelberg

This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 submissions. The workshop covered

…  See more details below

Overview

This book constitutes the thoroughly refereed post workshop proceedings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009, held in Copenhagen, Denmark, in September 2009 as part of the ALGO 2009 conference event. The 22 revised full papers presented were carefully reviewed and selected from 62 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques, real-world applications, and scheduling problems.

Product Details

ISBN-13:
9783642124495
Publisher:
Springer Berlin Heidelberg
Publication date:
04/23/2010
Series:
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues Series, #5893
Edition description:
2010
Pages:
255
Product dimensions:
6.20(w) x 9.10(h) x 0.70(d)

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.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >