Isbn: 9783540322122 - efficient approximation and online algorithms: recent progress on classical combinatorial optimization problems and new applications: 3484 (lecture notes in computer science, 3484) (19 resultados)

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

paperback. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Paperback. Condición: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments.

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condición: Used. pp. 364 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condición: Used. pp. 364.

Condición: As New. Unread book in perfect condition.

Condición: Used. pp. 364.

Paperback. Condición: New.

Condición: New.

Condición: New.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Brand New. 1st edition. 349 pages. 9.25x6.25x0.75 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Taschenbuch. Condición: Neu. 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. …

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 348 pp. Englisch.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Charts recent advances in the fieldContains carefully selected papers that cover some classical problems of scheduling, packing, and graph theoryContains new optimization problem.