6. WAOA 2008:
Karlsruhe,
Germany
Evripidis Bampis, Martin Skutella (Eds.):
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers.
Lecture Notes in Computer Science 5426 Springer 2009, ISBN 978-3-540-93979-5 
- Jochen Könemann, Ojas Parekh, David Pritchard:
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.
1-14
- Péter Biró, David Manlove, Shubham Mittal:
Size Versus Stability in the Marriage Problem.
15-28
- Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
Degree-Constrained Subgraph Problems: Hardness and Approximation Results.
29-42
- Tomás Ebenlendr, Jiri Sgall:
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.
43-52
- Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.
53-66
- René A. Sitters:
Minimizing Average Flow Time on Unrelated Machines.
67-77
- Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in Multiorganization Matching.
78-91
- Marcin Bienkowski, Marek Chrobak, Lukasz Jez:
Randomized Algorithms for Buffer Management with 2-Bounded Delay.
92-104
- Clemens Thielen, Sven Oliver Krumke:
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.
105-118
- Martin Gairing:
Malicious Bayesian Congestion Games.
119-132
- Tobias Harks:
Stackelberg Strategies and Collusion in Network Games with Splittable Flow.
133-146
- Amotz Bar-Noy, Matthew P. Johnson, Ou Liu:
Peak Shaving through Resource Buffering.
147-159
- Ariel Kulik, Hadas Shachnai:
On Lagrangian Relaxation and Subset Selection Problems.
160-173
- Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson:
Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements.
174-187
- Leah Epstein, Amos Fiat, Meital Levy:
Caching Content under Digital Rights Management.
188-200
- Davide Bilò, Peter Widmayer, Anna Zych:
Reoptimization of Weighted Graph and Covering Problems.
201-213
- Chris Gray, Maarten Löffler, Rodrigo I. Silveira:
Smoothing Imprecise 1.5D Terrains.
214-226
- Andreas Wiese, Evangelos Kranakis:
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.
227-240
- Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting:
Dynamic Offline Conflict-Free Coloring for Unit Disks.
241-252
- Wojciech Jawor, Marek Chrobak, Mart Molle:
Experimental Analysis of Scheduling Algorithms for Aggregated Links.
253-266
- Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt:
A Approximation Algorithm for the Minimum Maximal Matching Problem.
267-278
- Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
On the Maximum Edge Coloring Problem.
279-292
Last update Wed Feb 15 05:21:14 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
