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. Springer 2009 Lecture Notes in Computer Science 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
- 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
- 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
- Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson: Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. 174-187
- Davide Bilò, Peter Widmayer, Anna Zych: Reoptimization of Weighted Graph and Covering Problems. 201-213
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team