Skip to main content
  • Conference proceedings
  • © 2004

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

Conference proceedings info: RANDOM 2004, APPROX 2004.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (37 papers)

  1. Front Matter

  2. Contributed Talks of APPROX

    1. Designing Networks with Existing Traffic to Support Fast Restoration

      • Mansoor Alicherry, Randeep Bhatia, Yung-Chun (Justin) Wan
      Pages 1-12
    2. Simultaneous Source Location

      • Konstantin Andreev, Charles Garrod, Bruce Maggs, Adam Meyerson
      Pages 13-26
    3. Computationally-Feasible Truthful Auctions for Convex Bundles

      • Moshe Babaioff, Liad Blumrosen
      Pages 27-38
    4. On the Crossing Spanning Tree Problem

      • Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh
      Pages 51-60
    5. The Greedy Algorithm for the Minimum Common String Partition Problem

      • Marek Chrobak, Petr Kolman, Jiří Sgall
      Pages 84-95
    6. Polylogarithmic Inapproximability of the Radio Broadcast Problem

      • Michael Elkin, Guy Kortsarz
      Pages 105-116
    7. On Systems of Linear Equations with Two Variables per Equation

      • Uriel Feige, Daniel Reichman
      Pages 117-127
    8. Cost-Sharing Mechanisms for Network Design

      • Anupam Gupta, Aravind Srinivasan, Éva Tardos
      Pages 139-150
    9. Approximation Schemes for Broadcasting in Heterogenous Networks

      • Samir Khuller, Yoo-Ah Kim, Gerhard Woeginger
      Pages 163-170
    10. Convergence Issues in Competitive Games

      • Vahab S. Mirrokni, Adrian Vetta
      Pages 183-194
    11. Min-Max Multiway Cut

      • Zoya Svitkina, Éva Tardos
      Pages 207-218

Other Volumes

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

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
  • algorithm analysis and problem complexity

Editors and Affiliations

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

    Klaus Jansen

  • Dept. of CIS, Univ. of Pennsylvania, Philadelphia

    Sanjeev Khanna

  • Centre Universitaire d’Informatique, Carouge, Switzerland

    José D. P. Rolim

  • Tel-Aviv University, Ramat Aviv, Israel

    Dana Ron

Bibliographic Information

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

  • Book Subtitle: 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

  • Editors: Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron

  • Series Title: Lecture Notes in Computer Science

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2004

  • Softcover ISBN: 978-3-540-22894-3Published: 11 August 2004

  • eBook ISBN: 978-3-540-27821-4Published: 20 October 2004

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: X, 434

  • Topics: Theory of Computation, Computer Science, Algorithms, Discrete Mathematics in Computer Science, Numerical Analysis

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions