Efficient approximation and online algorithms

recent progress on classical combinatorical optimization problems and new applications

1st ed.
Efficient approximation and online algorithms
Klaus Jansen, Claire Kenyon
Locate

My Reading Lists:

Create a new list


Buy this book

Last edited by MARC Bot
July 30, 2019 | 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

The Physical Object

Pagination
vi, 347 p. :
Number of pages
347

Edition Identifiers

Open Library
OL23934004M
ISBN 10
3540322132
ISBN 13
9783540322139
LCCN
2006920093

Work Identifiers

Work ID
OL18600268W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
July 30, 2019 Edited by MARC Bot associate edition with work OL18600268W
November 24, 2009 Created by ImportBot Imported from Library of Congress MARC record