Geometric Algorithms and Combinatorial Optimization
No Customer Reviews
Select Format
Select Condition 
Book Overview
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. The book is a continuation and extension of previous research of the authors for which they received the Fulkerson prize, awarded by the Mathematical Programming Society and the American Mathematical Society. To quote from a review: "This book ... is doubtless one of the outstanding books in discrete mathematics at all." (Journal of Information Proceedings and Cybernetics).
Format:Paperback
Language:English
ISBN:3642782426
ISBN13:9783642782428
Release Date:December 2011
Publisher:Springer
Length:362 Pages
Weight:1.40 lbs.
Dimensions:0.8" x 6.7" x 9.5"
Customer Reviews
0 rating
Copyright © 2025 Thriftbooks.com
Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
ThriftBooks ® and the ThriftBooks ® logo are registered trademarks of Thrift Books Global, LLC
