A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Lap-Chi Lau is an Assistant Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. Lap-Chi's main research interests are in combinatorial optimization and graph algorithms. His paper on Steiner tree packing was given the Machtey award in the IEEE Foundations of Computer Science Conference. His Ph.D. thesis was awarded the Doctoral Prize from the Canadian Mathematical Society and a Doctoral Prize from the Natural Sciences and Engineering Research Council of Canada.
Inhaltsangabe
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.
