Efficient approximation and online algorithms

recent progress on classical combinatorical optimization problems and new applications

1st ed.

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today


Buy this book

Last edited by ImportBot
August 23, 2022 | History

Efficient approximation and online algorithms

recent progress on classical combinatorical optimization problems and new applications

1st ed.

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Springer
Language
English
Pages
347

Buy this book

Previews available in: English

Book Details


Edition Notes

Includes bibliographical references and index.

Published in
New York
Series
Lecture notes in computer science -- 3484

Classifications

Library of Congress
QA76.9.A43 E44 2006, QA75.5-76.95, QA76.9.A43 E38 2006eb

The Physical Object

Pagination
vi, 347 p. :
Number of pages
347

ID Numbers

Open Library
OL24042656M
Internet Archive
efficientapproxi0000unse
ISBN 10
3540322132
ISBN 13
9783540322139
LCCN
2006920093
OCLC/WorldCat
262692244
Deutsche National Bibliothek
979552303

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
August 23, 2022 Edited by ImportBot import existing book
February 9, 2019 Created by MARC Bot import existing book