Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
109.99 €
54 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Efficient Approximation and Online Algorithms “
Klappentext zu „Efficient Approximation and Online Algorithms “
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.
Inhaltsverzeichnis zu „Efficient Approximation and Online Algorithms “
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.
Bibliographische Angaben
- 2006, 348 Seiten, Maße: 15,7 x 23,9 cm, Kartoniert (TB), Englisch
- Herausgegeben:Bampis, Evripidis; Jansen, Klaus; Kenyon, Claire
- Herausgegeben: Evripidis Bampis, Klaus Jansen, Claire Kenyon
- Verlag: Springer
- ISBN-10: 3540322124
- ISBN-13: 9783540322122
- Erscheinungsdatum: 06.02.2006
Sprache:
Englisch
Kommentar zu "Efficient Approximation and Online Algorithms"
0 Gebrauchte Artikel zu „Efficient Approximation and Online Algorithms“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Efficient Approximation and Online Algorithms".
Kommentar verfassen