Häftad, Engelska, 2006
Del i serien Lecture Notes in Computer Science
Efficient Approximation and Online Algorithms
Recent Progress on Classical Combinatorial Optimization Problems and New Applications
Av Evripidis Bampis, Klaus Jansen, Claire Kenyon
739 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Beskrivning
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.
Produktinformation
- Utgivningsdatum: 2006-02-06
- Mått: 155 x 235 x undefined mm
- Format: Häftad
- Språk: Engelska
- Serie: Lecture Notes in Computer Science
- Antal sidor: 348
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN: 9783540322122
Utforska kategorier
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.