GetTextbooks.com
Compare Prices & Save up to 90%
Search by ISBN, title, author, etc ...
Login
|
Sign up
|
My Wish List
Books 1 - 3 of 3 |
Previous
|
Next
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 8th International Workshop on Approximation Algorithms for Compinatorial ... (Lecture Notes in Computer Science)
(1st Edition)
by
Chandra Chekuri (Editor)
,
Klaus Jansen (Editor)
,
José D.P. Rolim (Editor)
,
Luca
Trevisan
(Editor)
Paperback
, 495 Pages
, Published 2005 by Springer
, 1st Edition
Compare Prices
|
Add to Wish List
|
Set Price Alert
Average-Case Complexity (Foundations and Trends(R) in Theoretical Computer Science)
by
Andrej Bogdanov
,
Luca
Trevisan
Paperback
, 124 Pages
, Published 2006 by Now Publishers Inc
Compare Prices
|
Add to Wish List
|
Set Price Alert
When Hamming Meets Euclid: The Approximability of Geometric TSP and MST
by
Luca
Trevisan
Paperback
, Published 0001 by University of Geneva
Compare Prices
|
Add to Wish List
|
Set Price Alert
Books 1 - 3 of 3 |
Previous
|
Next
Home
|
Browse
|
Professors
|
Merchants
|
Webmasters
|
Contact Us
[
Canada
|
United Kingdom
]
Copyright © 2003-2008
GetTextbooks.com