Evripidis Bampis,
Klaus Jansen,
Claire Kenyon
Springer Berlin Heidelberg
2006e druk, 2006
9783540322122
Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Specificaties
Paperback, 349 blz.
|
Engels
Springer Berlin Heidelberg |
2006e druk, 2006
ISBN13: 9783540322122
Rubricering
Onderdeel van serie
Theoretical Computer Science and General Issues
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540322122
Taal:Engels
Bindwijze:paperback
Aantal pagina's:349
Uitgever:Springer Berlin Heidelberg
Druk:2006
Hoofdrubriek:Programmeren, Computer en informatica
Inhoudsopgave
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.
