Lecture Notes in Computer Science

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003

Editors: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (Eds.)

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-45198-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-40770-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.

The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.

Table of contents (33 chapters)

  • Correlation Clustering with Partial Information

    Demaine, Erik D. (et al.)

    Pages 1-13

  • Improved Linear Time Approximation Algorithms for Weighted Matchings

    Drake, Doratha E. (et al.)

    Pages 14-23

  • Covering Graphs Using Trees and Stars

    Even, G. (et al.)

    Pages 24-35

  • An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor

    Fakcharoenphol, Jittat (et al.)

    Pages 36-46

  • Approximation Algorithms for Channel Allocation Problems in Broadcast Networks

    Gandhi, Rajiv (et al.)

    Pages 47-58

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-45198-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-40770-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Book Subtitle
6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003
Editors
  • Sanjeev Arora
  • Klaus Jansen
  • Jose D.P. Rolim
  • Amit Sahai
Series Title
Lecture Notes in Computer Science
Series Volume
2764
Copyright
2003
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-45198-3
DOI
10.1007/b11961
Softcover ISBN
978-3-540-40770-6
Series ISSN
0302-9743
Edition Number
1
Number of Pages
IX, 411
Topics