Lecture Notes in Computer Science 6534

Transcription

1 Lecture Notes in Computer Science 6534 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Klaus Jansen Roberto Solis-Oba (Eds.) Approximation and OnlineAlgorithms 8th International Workshop, WAOA 2010 Liverpool, UK, September 9-10, 2010 Revised Papers 13

3 Volume Editors Klaus Jansen University of Kiel, Department of Computer Science Olshausenstrasse 40, Kiel, Germany Roberto Solis-Oba The University of Western Ontario, Department of Computer Science London, Ontario N6A 5B7, Canada ISSN e-issn ISBN e-isbn DOI / Springer Heidelberg Dordrecht London New York Library of Congress Control Number: CR Subject Classification (1998): F.2.2, G.2.1-2, G.1.2, G.1.6, E.1, C.2, I.3.5 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (

4 Klaus Jansen Roberto Solis-Oba (Eds.) Approximation and OnlineAlgorithms 8th International Workshop, WAOA 2010 Liverpool, UK, September 9-10, 2010 Revised Papers 13

5 Organization Program Co-chairs Klaus Jansen Roberto Solis-Oba University of Kiel, Germany University of Western Ontario, Canada Program Committee Klaus Jansen (Co-chair) Roberto Solis-Oba (Co-chair) Evripidis Bampis Jianer Chen Jose Correa Khaled Elbassioni Rudolf Fleischer Thomas Erlebach Martin Fürer Christos Kaklamanis Jochen Könemann Stefano Leonardi Alejandro López-Ortiz Monaldo Mastrolilli Hadas Shachnai Martin Skutella Clifford Stein Denis Trystram University of Kiel, Germany University of Western Ontario, Canada University of Evry, France Texas A&M University, USA Universidad de Chile, Chile Max Planck Institut für Informatik, Germany Fudan University, China University of Leicester, UK The Pennsylvania State University, USA University of Patras, Greece University of Waterloo, Canada Sapienza University of Rome, Italy University of Waterloo, Canada IDSIA Lugano, Switzerland Israel Institute of Technology, Israel TU Berlin, Germany Columbia University, USA Grenoble Institute of Technology, France Additional Referees Sivan Albagli Susanne Albers Eric Angel Stavros Athanassopoulos Nikhil Bansal Vincenzo Bonifaci Marin Bougeret Mohamed Slim Bouguerra David Bunde Chandra Chekuri Ning Chen Janka Chlebikova Daniel Cordeiro Andy Curtis Reza Dorrigiv Christoph Dürr Stephane Durocher Leah Epstein Bruno Escoffier Samuel Fiorini Mohamoud Fouz Robert Fraser Hiroshi Fujiwara Leslie Ann Goldberg

6 VIII Organization Laurent Gourves Fabrizio Grandoni Martin Groß Inge Li Gørtz Angele Hamel Martin Hoefer Riko Jacob Panagiotis Kanellopoulos Nikos Karanikolas Hans Kellerer Alexandra Kolla Ravishankar Krishnaswamy Sven Krumke Piotr Krysta Raghav Kulkarni Maria Kyropoulou Van Bang Le Lap-Kei Lee Dimitris Letsios Asaf Levin Martin Matamala Vardges Melkonian Nikola Milosavljevic Vahab Mirrokni Jerome Monnot Luca Moscardelli Benjamin Moseley Gregory Mounie Alantha Newman Kim Thang Nguyen Zeev Nutov Christina Otte Andrea Pacifici Evi Papaioannou Ojas Parekh Fanny Pascual David Pritchard Kirk Pruhs Lars Prädel Claude-Guy Quimper Rajiv Raman Thomas Rothvoss Alejandro Salinger Ulrich M. Schwarz Rene Sitters Alexander Souza Georgios Stamoulis Sebastian Stiller Martin Strauss Zoya Svitkina Tami Tamir Nicolas Thibault Marc Uetz Rob van Stee Anke van Zuylen José Verschae Tjark Vredeveld Andreas Wiese Prudence W.H. Wong

7 Table of Contents WAOA 2010 Strategic Multiway Cut and Multicut Games... 1 Elliot Anshelevich, Bugra Caskurlu, and Ameya Hate Approximating Directed Buy-at-Bulk Network Design Spyridon Antonakopoulos New Lower Bounds for Certain Classes of Bin Packing Algorithms János Balogh, József Békési, and Gábor Galambos On the Approximation Complexity Hierarchy Magnus Bordewich The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers Patrick Briest and Heiko Röglin Tradeoff between Energy and Throughput for Online Deadline Scheduling Ho-Leung Chan, Tak-Wah Lam, and Rongbin Li New Models and Algorithms for Throughput Maximization in Broadcast Scheduling (Extended Abstract) Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard McCutchen, Benjamin Moseley, and Louiqa Raschid Densest k-subgraph Approximation on Intersection Graphs Danny Z. Chen, Rudolf Fleischer, and Jian Li The Train Delivery Problem Vehicle Routing Meets Bin Packing Aparna Das, Claire Mathieu, and Shay Mozes An FPTAS for Flows over Time with Aggregate Arc Capacities Daniel Dressler and Martin Skutella List Factoring and Relative Worst Order Analysis Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen Approximation Algorithms for Domination Search Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos Lower Bounds for Smith s Rule in Stochastic Machine Scheduling Caroline Jagtenberg, Uwe Schwiegelshohn, and Marc Uetz

8 X Table of Contents Approximating Survivable Networks with Minimum Number of Steiner Points Lior Kamma and Zeev Nutov A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks Andreas Karrenbauer and Thomas Rothvoß Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data Tak-Wah Lam, Chi-Man Liu, and Hing-Fung Ting How to Play Unique Games on Expanders Konstantin Makarychev and Yury Makarychev Online Ranking for Tournament Graphs Claire Mathieu and Adrian Vladu Throughput Maximization for Periodic Packet Routing on Trees and Grids Britta Peis and Andreas Wiese k-edge-connectivity: Approximation and LP Relaxation David Pritchard Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability Kirk Pruhs, Julien Robert, and Nicolas Schabanel An Improved Algorithm for Online Rectangle Filling Rob van Stee Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems Tomoyuki Yamakami Author Index