Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
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.
CHF 108.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
L048:
Lieferbar in 48 Stunden
Produktdetails
Weitere Autoren: Jansen, Klaus (Hrsg.) / Kenyon, Claire (Hrsg.)
- ISBN: 978-3-540-32212-2
- EAN: 9783540322122
- Produktnummer: 31948147
- Verlag: Springer Nature EN
- Sprache: Englisch
- Erscheinungsjahr: 2006
- Seitenangabe: 348 S.
- Masse: H23.5 cm x B15.5 cm 557 g
- Reihenbandnummer: 3484
- Gewicht: 557
- Sonstiges: Research
13 weitere Werke von Evripidis (Hrsg.) Bampis:
Experimental Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Ebook (PDF Format)
CHF 82.50
Bewertungen
Anmelden