Klaus (Hrsg.) Jansen
Approximation Algorithms for Combinatorial Optimization
5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings
Ebook (PDF Format)
This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002.The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, an…
Mehr
Beschreibung
This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002.The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fields.
CHF 93.50
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
Versandkostenfrei
Produktdetails
Weitere Autoren: Leonardi, Stefano (Hrsg.) / Vazirani, Vijay (Hrsg.)
- ISBN: 978-3-540-45753-4
- EAN: 9783540457534
- Produktnummer: 37296453
- Verlag: Springer Berlin Heidelberg
- Sprache: Englisch
- Erscheinungsjahr: 2003
- Seitenangabe: 276 S.
- Plattform: PDF
- Auflage: 2002
- Reihenbandnummer: 2462
41 weitere Werke von Klaus (Hrsg.) Jansen:
Bewertungen
0 von 0 Bewertungen
Anmelden
Keine Bewertungen gefunden. Seien Sie der Erste und teilen Sie Ihre Erkenntnisse mit anderen.