Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2005

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

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

Editors:

  1. Chandra Chekuri

    1. Dept. of Computer Science, University of Illinois, Urbana

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Klaus Jansen

    1. Institute for Computer Science, University of Kiel, Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. José D. P. Rolim

    1. Battelle Bâtiment A, Centre Universitaire d’Informatique, Carouge, Geneva, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Luca Trevisan

    1. UC Berkeley,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): APPROX: International Workshop on Approximation Algorithms for Combinatorial Optimization, RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science

Conference proceedings info: APPROX 2005, RANDOM 2005.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (41 papers)

  2. Contributed Talks of RANDOM

    1. Bounds for Error Reduction with Few Quantum Queries

      • Sourav Chakraborty, Jaikumar Radhakrishnan, Nandakumar Raghunathan
      Pages 245-256

    2. Sampling Bounds for Stochastic Optimization

      • Moses Charikar, Chandra Chekuri, Martin Pál
      Pages 257-269

    3. An Improved Analysis of Mergers

      • Zeev Dvir, Amir Shpilka
      Pages 270-281

    4. Finding a Maximum Independent Set in a Sparse Random Graph

      • Uriel Feige, Eran Ofek
      Pages 282-293

    5. On the Error Parameter of Dispersers

      • Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
      Pages 294-305

    6. Tolerant Locally Testable Codes

      • Venkatesan Guruswami, Atri Rudra
      Pages 306-317

    7. A Lower Bound on List Size for List Decoding

      • Venkatesan Guruswami, Salil Vadhan
      Pages 318-329

    8. A Lower Bound for Distribution-Free Monotonicity Testing

      • Shirley Halevy, Eyal Kushilevitz
      Pages 330-341

    9. On Learning Random DNF Formulas Under the Uniform Distribution

      • Jeffrey C. Jackson, Rocco A. Servedio
      Pages 342-353

    10. Derandomized Constructions of k-Wise (Almost) Independent Permutations

      • Eyal Kaplan, Moni Naor, Omer Reingold
      Pages 354-365

    11. Testing Periodicity

      • Oded Lachish, Ilan Newman
      Pages 366-377

    13. The Online Clique Avoidance Game on Random Graphs

      • Martin Marciniszyn, Reto Spöhel, Angelika Steger
      Pages 390-401

    15. A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas

      • Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos, Moshe Y. Vardi
      Pages 414-425

    16. Mixing Points on a Circle

      • Dana Randall, Peter Winkler
      Pages 426-435

    17. Derandomized Squaring of Graphs

      • Eyal Rozenman, Salil Vadhan
      Pages 436-447
Back to top

Other Volumes

  1. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Back to top

Keywords

Back to top

Editors and Affiliations

  • Dept. of Computer Science, University of Illinois, Urbana

    Chandra Chekuri

  • Institute for Computer Science, University of Kiel, Kiel, Germany

    Klaus Jansen

  • Battelle Bâtiment A, Centre Universitaire d’Informatique, Carouge, Geneva, Switzerland

    José D. P. Rolim

  • UC Berkeley,  

    Luca Trevisan

Back to top

Bibliographic Information

  • Book Title: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

  • Book Subtitle: 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings

  • Editors: Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/11538462

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2005

  • Softcover ISBN: 978-3-540-28239-6Published: 08 August 2005

  • eBook ISBN: 978-3-540-31874-3Published: 25 August 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 495

  • Topics: Algorithm Analysis and Problem Complexity, Numeric Computing, Discrete Mathematics in Computer Science, Algorithms

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation