Advertisement

Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques

Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX’99, Berkeley, CA, USA, August 8-11, 1999.

  • Dorit S. Hochbaum
  • Klaus Jansen
  • José D. P. Rolim
  • Alistair Sinclair
Conference proceedings RANDOM 1999, APPROX 1999

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

Table of contents

  1. Front Matter
  2. Session Random 1

    1. Andrei Z. Broder, Michael Mitzenmacher
      Pages 1-10
    2. Michael Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
      Pages 11-15
  3. Session Approx 1

    1. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
      Pages 28-38
    2. Benjamin Doerr, Anand Srivastav
      Pages 39-50
  4. Session Approx 2

    1. Magnús M. Halldórsson, Guy Kortsarz
      Pages 73-84
  5. Session: Random 2

    1. Michal Parnas, Dana Ron
      Pages 85-96
    2. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
      Pages 97-108
    3. Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
      Pages 109-120
  6. Invited Talk

  7. Session Random 3

    1. Oded Goldreich, Avi Wigderson
      Pages 131-137
    2. Andreas Baltz, Tomasz Schoen, Anand Srivastav
      Pages 138-143
  8. Session Approx 3

    1. Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
      Pages 144-155
    2. Dimitris A. Fotakis, Paul G. Spirakis
      Pages 156-167
    3. Csanád Imreh, John Noga
      Pages 168-176
    4. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
      Pages 177-188
  9. Invited Talk

  10. Session Approx 4

  11. Session Random 4

    1. Anne Condon, Richard M. Karp
      Pages 221-232
    2. Tuğkan Batu, Ronitt Rubinfeld, Patrick White
      Pages 245-256
  12. Minisymposium on Scheduling Talks

    1. Susanne Albers, Günter Schmidt
      Pages 269-280
    2. F. Afrati, E. Bampis, C. Kenyon, I. Milis
      Pages 281-287
  13. Back Matter

About these proceedings

Keywords

Approximation Algorithms Combinatorial Approximation Complexity Randomization Scheduling algorithms combinatorial optimization computer computer science optimization

Editors and affiliations

  • Dorit S. Hochbaum
    • 1
  • Klaus Jansen
    • 2
  • José D. P. Rolim
    • 3
  • Alistair Sinclair
    • 4
  1. 1.Department of Industrial Engineering and Operations Research and Walter A. Haas School of BusinessUniversity of CaliforniaBerkeley
  2. 2.Institute for Computer ScienceUniversity of KielKielGermany
  3. 3.Centre Universitaire d’InformatiqueCarouge, GenevaSwitzerland
  4. 4.Computer Science DivisionUniversity of CaliforniaBerkeley

Bibliographic information

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