An edition of Efficient approximation and online algorithms
(2006)
Efficient approximation and online algorithms
recent progress on classical combinatorical optimization problems and new applications
1st ed.
by Klaus Jansen and Claire Kenyon
- 0 Ratings
- 0 Want to read
- 0 Currently reading
- 0 Have read
Share
×Close
![Cover of: Efficient approximation and online algorithms by [edited by] Evripidis Bampis, Klaus Jansen, Claire Kenyon.](/images/icons/avatar_book.png){kind=icon}
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Computer algorithms, Combinatorial optimization, Online algorithms, Data processing, Algorithms, Optimisation combinatoire, Algorithmes en ligne, Algorithmes, Informatique, COMPUTERS, Programming, Open Source, Software Development & Engineering, Tools, General, Approximationsalgorithmus, Kombinatorische Optimierung, Online-AlgorithmusShowing 2 featured editions. View all 2 editions?
| Edition | Availability |
|---|---|
1
Efficient approximation and online algorithms: recent progress on classical combinatorical optimization problems and new applications
2006, Springer
in English
- 1st ed.
3540322132 9783540322139
|
cccc
Libraries near you:
WorldCat
|
2
Efficient approximation and online algorithms: recent progress on classical combinatorical optimization problems and new applications
2006, Springer
in English
- 1st ed.
3540322132 9783540322139
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references and index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created November 24, 2009
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| 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 |