Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Evripidis Bampis (u. a.)

ISBN 10: 3540322124 / ISBN 13: 9783540322122

Published by Springer, 2006

About this Item

Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications | Evripidis Bampis (u. a.) | Taschenbuch | viii | Englisch | 2006 | Springer | EAN 9783540322122 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 102240737

Bibliographic Details

• Title: Efficient Approximation and Online Algorithms | Recent Progress on Classical Combinatorial Optimization Problems and New Applications
• Publisher: Springer
• Publication Date: 2006
• Language: English
• ISBN 10: 3540322124
• ISBN 13: 9783540322122
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 20W x 155H x 235D millimeters 20 millimeters width by 155 millimeters height by 235 millimeters depth
• Weight: 552 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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.