Mohlo by se vám také líbit

Více informací o knize Approximation Algorithms for Combinatorial Optimization

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 118 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: Approximation Algorithms for Combinatorial Optimization
• Podnázev: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings
• Autor: Klaus Jansen, Stefano Leonardi, Vijay Vazirani
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 276
• EAN: 9783540441861
• ISBN: 3540441867
• ID: 01564624
• Nakladatelství: Springer, Berlin
• Hmotnost: 404 g
• Rozměry: 235 × 155 × 15 mm
• Rok vydání: 2002

Oblíbené z jiného soudku

---

---

---