Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- PDF / 11,646,417 Bytes
- 794 Pages / 430 x 660 pts Page_size
- 96 Downloads / 220 Views
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
6302
Maria Serna Ronen Shaltiel Klaus Jansen José Rolim (Eds.)
Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010 Barcelona, Spain, September 1-3, 2010 Proceedings
13
Volume Editors Maria Serna Universitat Politècnica de Catalunya Dept. de Llenguatges i Sistemes Informàtics Jordi Girona Salgado, 1-3, 08034 Barcelona, Spain E-mail: [email protected] Ronen Shaltiel University of Haifa, Department of Computer Science Mount Carmel, Haifa 31905, Israel E-mail: [email protected] Klaus Jansen University of Kiel, Department of Computer Science Olshausenstrasse 40, 24098 Kiel, Germany E-mail: [email protected] José Rolim University of Geneva, Centre Universitaire d’Informatique Battelle Bat. A, 7 rte de Drize, 1227 Carouge, Switzerland E-mail: [email protected]
Library of Congress Control Number: 2010932674 CR Subject Classification (1998): F.2, E.1, G.2, I.3.5, F.1, C.2 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues ISSN ISBN-10 ISBN-13
0302-9743 3-642-15368-2 Springer Berlin Heidelberg New York 978-3-642-15368-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.com © Springer-Verlag Berlin Heidelberg 2010 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper 06/3180
Preface
This volume contains the papers presented at the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2010) and the 14th International Workshop on Randomiz
Data Loading...