Combinatorial optimization. Theory and applications. (Q2574644): Difference between revisions

In the last years Korte and J. Vygen's ``Combinatorial Optimization. Theory and Algorithms'' has become a standard textbook in the field. 5 years after the first edition (see Zbl 0953.90052), the 3rd revised edition is available. It contains now a new chapter on facility location. In many places important new esults were added like Fujishige's maximum flow algorithm, Schrijver's algorithm for the minimization of submodular functions, and a Steiner tree approximation algorithm (Robins-Zelikovsky). Moreover, several other important and interesting topics were added such as Fibonacci heaps or flows over time. Beyond that, several proofs have been streamlined, the references have been updated and new exercises have been added. That makes this volume to one of the most comprehensive and up-to-date textbooks in the field of combinatorial optimization.