Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

  • PDF / 5,540,183 Bytes
  • 504 Pages / 430 x 660 pts Page_size
  • 61 Downloads / 226 Views

DOWNLOAD

REPORT


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 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 University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany

3624

Chandra Chekuri Klaus Jansen José D.P. Rolim Luca Trevisan (Eds.)

Approximation, Randomization and Combinatorial Optimization Algorithms and Techniques 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005 Berkeley, CA, USA, August 22-24, 2005 Proceedings

13

Volume Editors Chandra Chekuri Lucent Bell Labs 600 Mountain Avenue, Murray Hill, NJ 07974, USA E-mail: [email protected] Klaus Jansen University of Kiel, Institute for Computer Science Olshausenstr. 40, 24098 Kiel, Germany E-mail: [email protected] José D.P. Rolim Université de Genève, Centre Universitaire d’Informatique 24, Rue Général Dufour, 1211 Genève 4, Suisse E-mail: [email protected] Luca Trevisan University of California, Computer Science Department 679 Soda Hall, Berkeley, CA 94720-1776, USA E-mail: [email protected]

Library of Congress Control Number: 2005930720 CR Subject Classification (1998): F.2, G.2, G.1 ISSN ISBN-10 ISBN-13

0302-9743 3-540-28239-4 Springer Berlin Heidelberg New York 978-3-540-28239-6 Springer Berlin Heidelberg New York

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. Springer is a part of Springer Science+Business Media springeronline.com © Springer-Verlag Berlin Heidelberg 2005 Printed in Germany Typesetting: Camera-ready by author, data conversion by Olgun Computergrafik Printed on acid-free paper SPIN: 11538462 06/3142 543210

Preface

This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop