Combinatorial optimization: Exact and ap
β Trevisan L.
π Library
π
2011
π Stanford Univ.
π English
β¦ LIBER β¦
π
Combinatorial Optimization: Exact and Approximate Algorithms
β Scribed by Luca Trevisan
- Publisher
- Stanford University
- Tongue
- English
- Leaves
- 139
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Combinatorial Optimization: Theory and A
β Bernhard Korte, Jens Vygen
π Library
π
2005
π Springer
π English
This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by
Combinatorial Optimization: Theory and A
β Bernhard Korte, Jens Vygen
π Library
π
2002
π Springer
π English
Combinatorial Optimization: Theory and A
β Bernhard Korte
π Library
π
2012
π Springer
π English
<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This
Geometric Algorithms and Combinatorial O
β Martin GrΓΆtschel, Laszlo Lovasz, Alexander Schrijver
π Library
π
1993
π Springer
π English
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 which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin
Geometric Algorithms and Combinatorial O
β Martin GrΓΆtschel, Laszlo Lovasz, Alexander Schrijver
π Library
π
1993
π Springer
π English
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 which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin