✦ LIBER ✦
Groetschel, M., L. Lovasz, A. Schrijver: Geometric Algorithms and Combinatorial Optimization. (Algorithms and Combinatorics. Eds.: R. L. Graham, B. Korte, L. Lovasz. Vol. 2), Springer-Verlag 1988, XII, 362 pp., 23 Figs., DM 148,-. ISBN 3–540–13624-X
✍ Scribed by D. Seese
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 71 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0323-3847
No coin nor oath required. For personal study only.
✦ Synopsis
I n the last yearsgeometric techniques for proving polynomial time solvability of problems in convexity theory, geometry and combinatorial optimization attained wide acceptance. Especially the sensational result of L. G. Khachiyan t h a t linear programs are solvable in polynomial time using