Efficient Approximation And Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems And New Applications

Bampis, Evripidis (EDT); Jansen, Klaus (EDT); Kenyon, Claire (EDT)

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Editore: Springer, 2006

Riguardo questo articolo

Codice articolo 6909096-n

Dati bibliografici

• Titolo: Efficient Approximation And Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems And New Applications
• Editore: Springer
• Data di pubblicazione: 2006
• Lingua: Inglese
• ISBN 10: 3540322124
• ISBN 13: 9783540322122
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.

Contenuti

Contributed Talks.- On Approximation Algorithms for Data Mining Applications.- A Survey of Approximation Results for Local Search Algorithms.- Approximation Algorithms for Path Coloring in Trees.- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow.- Independence and Coloring Problems on Intersection Graphs of Disks.- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications.- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines.- Approximating a Class of Classification Problems.- List Scheduling in Order of ?-Points on a Single Machine.- Approximation Algorithms for the k-Median Problem.- The Lovász-Local-Lemma and Scheduling.