Iterative methods in combinatorial optimization / Lap Chi Lau, R. Ravi, Mohit Singh.
"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence,...
Saved in:
| Superior document: | Cambridge texts in applied mathematics |
|---|---|
| : | |
| TeilnehmendeR: | |
| Year of Publication: | 2011 |
| Language: | English |
| Series: | Cambridge texts in applied mathematics.
|
| Online Access: | |
| Physical Description: | xi, 242 p. :; ill. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Machine generated contents note: 1. Introduction; 2. Preliminaries; 3. Matching and vertex cover in bipartite graphs; 4. Spanning trees; 5. Matroids; 6. Arborescence and rooted connectivity; 7. Submodular flows and applications; 8. Network matrices; 9. Matchings; 10. Network design; 11. Constrained optimization problems; 12. Cut problems; 13. Iterative relaxation: early and recent examples; 14. Summary.