Advertisement

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004. Proceedings

  • Klaus Jansen
  • Sanjeev Khanna
  • José D. P. Rolim
  • Dana Ron
Conference proceedings RANDOM 2004, APPROX 2004

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3122)

Table of contents

  1. Front Matter
  2. Contributed Talks of APPROX

    1. Mansoor Alicherry, Randeep Bhatia, Yung-Chun (Justin) Wan
      Pages 1-12
    2. Konstantin Andreev, Charles Garrod, Bruce Maggs, Adam Meyerson
      Pages 13-26
    3. Moshe Babaioff, Liad Blumrosen
      Pages 27-38
    4. Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh
      Pages 51-60
    5. Marek Chrobak, Petr Kolman, Jiří Sgall
      Pages 84-95
    6. Michael Elkin, Guy Kortsarz
      Pages 105-116
    7. Uriel Feige, Daniel Reichman
      Pages 117-127
    8. Anupam Gupta, Aravind Srinivasan, Éva Tardos
      Pages 139-150
    9. Samir Khuller, Yoo-Ah Kim, Gerhard Woeginger
      Pages 163-170
    10. Vahab S. Mirrokni, Adrian Vetta
      Pages 183-194
    11. Zoya Svitkina, Éva Tardos
      Pages 207-218
  3. Contributed Talks of RANDOM

    1. Dimitris Achlioptas, Cristopher Moore
      Pages 219-228
    2. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
      Pages 229-236
    3. Noga Alon, Vera Asodi
      Pages 237-248
    4. Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
      Pages 261-272
    5. Michael Ben Or, Don Coppersmith, Mike Luby, Ronitt Rubinfeld
      Pages 273-285
    6. Eli Ben-Sasson, Madhu Sudan
      Pages 286-297
    7. Amin Coja-Oghlan, Andreas Goerdt, André Lanka
      Pages 310-321
    8. Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
      Pages 322-333
    9. Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz
      Pages 334-344
    10. Abraham D. Flaxman, Alan M. Frieze
      Pages 345-356
    11. David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
      Pages 357-368
    12. Dan Gutfreund, Emanuele Viola
      Pages 381-392
    13. Shirley Halevy, Eyal Kushilevitz
      Pages 393-404
    14. Michael Langberg
      Pages 405-416
    15. Luca Trevisan
      Pages 417-425
  4. Back Matter

About these proceedings

Keywords

algorithms approximation approximation algorithms coding combinatorial optimization complexity complexity theory computational discrete mathematics computational graph theory derandomization game theory online algorithms optimization randomization randomized algorithms

Editors and affiliations

  • Klaus Jansen
    • 1
  • Sanjeev Khanna
    • 2
  • José D. P. Rolim
    • 3
  • Dana Ron
    • 4
  1. 1.Institute for Computer ScienceUniversity of KielKielGermany
  2. 2.Dept. of CISUniv. of PennsylvaniaPhiladelphia
  3. 3.Centre Universitaire d’InformatiqueCarougeSwitzerland
  4. 4.Tel-Aviv UniversityRamat AvivIsrael

Bibliographic information

  • DOI https://doi.org/10.1007/b99805
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-22894-3
  • Online ISBN 978-3-540-27821-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications