Geometric Algorithms and Combinatorial Optimization /
This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and - in particular - combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms: - the ellipsoid method for finding a point in...
| Main Author: | |
|---|---|
| Corporate Author: | |
| Other Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
1988.
|
| Series: | Algorithms and combinatorics ;
2. |
| Subjects: | |
| Online Access: | Connect to the full text of this electronic book |
Search Result 1
Search Result 2
