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

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings

Editors:

  1. Moses Charikar

    1. Computer Science Dept., Princeton University, Princeton, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Klaus Jansen

    1. Institut für Informatik, Christian-Albrechts-Universität zu Kiel,, Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Omer Reingold

    1. Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. José D. P. Rolim

    1. Centre Universitaire d’Informatique,, Geneva, Switzerland

    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 4627)

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 2007, RANDOM 2007.

Sections

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (44 papers)

  1. Front Matter

    PDF

  2. Contributed Talks of APPROX

    2. A Knapsack Secretary Problem with Applications

      • Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg
      Pages 16-28

    4. Improved Approximation Algorithms for the Spanning Star Forest Problem

      • Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh
      Pages 44-58

    5. Packing and Covering δ-Hyperbolic Spaces by Balls

      • Victor Chepoi, Bertrand Estellon
      Pages 59-73

    10. Stochastic Steiner Tree with Non-uniform Inflation

      • Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
      Pages 134-148

    13. Optimal Resource Augmentations for Online Knapsack

      • Kazuo Iwama, Guochuan Zhang
      Pages 180-188

    14. Soft Edge Coloring

      • Chadi Kari, Yoo-Ah Kim, Seungjoon Lee, Alexander Russell, Minho Shin
      Pages 189-203

    15. Approximation Algorithms for the Max-Min Allocation Problem

      • Subhash Khot, Ashok Kumar Ponnuswami
      Pages 204-217

    16. Hardness of Embedding Metric Spaces of Equal Size

      • Subhash Khot, Rishi Saket
      Pages 218-227

    17. Coarse Differentiation and Multi-flows in Planar Graphs

      • James R. Lee, Prasad Raghavendra
      Pages 228-241

    18. Maximum Gradient Embeddings and Monotone Clustering

      • Manor Mendel, Assaf Naor
      Pages 242-256
Back to top

Other Volumes

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

Back to top

Keywords

Back to top

Editors and Affiliations

  • Computer Science Dept., Princeton University, Princeton, USA

    Moses Charikar

  • Institut für Informatik, Christian-Albrechts-Universität zu Kiel,, Kiel, Germany

    Klaus Jansen

  • Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel

    Omer Reingold

  • Centre Universitaire d’Informatique,, Geneva, Switzerland

    José D. P. Rolim

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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