Skip to main content
SpringerLink
Log in

Efficient Approximation and Online Algorithms

Recent Progress on Classical Combinatorial Optimization Problems and New Applications

  • Book
  • © 2006

Overview

Editors:
  1. Evripidis Bampis

    1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Evry Cedex, France

    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. Claire Kenyon

    1. Brown University, Providence, USA

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

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

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Download chapter PDF

  2. Contributed Talks

    1. On Approximation Algorithms for Data Mining Applications

      • Foto N. Afrati
      Pages 1-29

    2. A Survey of Approximation Results for Local Search Algorithms

      • Eric Angel
      Pages 30-73

    3. Approximation Algorithms for Path Coloring in Trees

      • Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
      Pages 74-96

    4. Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

      • Thomas Erlebach
      Pages 97-134

    5. Independence and Coloring Problems on Intersection Graphs of Disks

      • Thomas Erlebach, Jiří Fiala
      Pages 135-155

    6. Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications

      • Klaus Jansen
      Pages 156-202

    7. A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines

      • Stefano Leonardi
      Pages 203-212

    8. Approximating a Class of Classification Problems

      • Ioannis Milis
      Pages 213-249

    9. List Scheduling in Order of α-Points on a Single Machine

      • Martin Skutella
      Pages 250-291

    10. Approximation Algorithms for the k-Median Problem

      • Roberto Solis-Oba
      Pages 292-320

    11. The Lovász-Local-Lemma and Scheduling

      • Anand Srivastav
      Pages 321-347

  3. Back Matter

    Download chapter PDF
Back to top

Keywords

Editors and Affiliations

  • IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Evry Cedex, France

    Evripidis Bampis

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

    Klaus Jansen

  • Brown University, Providence, USA

    Claire Kenyon

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation