7. WAOA 2009:
Copenhagen,
Denmark
Evripidis Bampis, Klaus Jansen (Eds.):
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers.
Lecture Notes in Computer Science 5893 Springer 2010, ISBN 978-3-642-12449-5 
- Spyros Angelopoulos:
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.
1-12
- Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.
13-24
- Marcin Bienkowski:
Price Fluctuations: To Buy or to Rent.
25-36
- Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram:
Approximation Algorithms for Multiple Strip Packing.
37-48
- Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.
49-61
- Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling [Extended Abstract].
62-74
- Ilya Chernykh, Nikita Dryuck, Alexander Kononov, Sergey Sevastyanov:
The Routing Open Shop Problem: New Approximation Algorithms.
75-85
- George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee:
On the Price of Stability for Undirected Network Design.
86-97
- Atish Das Sarma, Amit Deshpande, Ravi Kannan:
Finding Dense Subgraphs in G(n, 1/2).
98-103
- Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz:
Parameterized Analysis of Paging and List Update Algorithms.
104-115
- Christoph Dürr, Lukasz Jez, Nguyen Kim Thang:
Online Scheduling of Bounded Length Jobs to Maximize Throughput.
116-127
- Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén:
On the Additive Constant of the k-Server Work Function Algorithm.
128-134
- Thomas Erlebach, Matús Mihalák:
A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs.
135-146
- Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov:
Guard Games on Graphs: Keep the Intruder Out!
147-158
- Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger:
Between a Rock and a Hard Place: The Two-to-One Assignment Problem.
159-169
- Elisabeth Günther, Felix G. König, Nicole Megow:
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.
170-181
- Xin Han, Kazuhisa Makino:
Online Minimization Knapsack Problem.
182-193
- Danny Hermelin, Dror Rawitz:
Optimization Problems in Multiple Subtree Graphs.
194-204
- Bodo Manthey:
Multi-Criteria TSP: Min and Max Combined.
205-216
- Britta Peis, Martin Skutella, Andreas Wiese:
Packet Routing: Complexity and Algorithms.
217-228
- Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal Cost Reconfiguration of Data Placement in Storage Area Network.
229-241
- Prudence W. H. Wong, Fencol C. C. Yung:
Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing.
242-254
Last update Fri May 25 08:47:41 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
