This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.(Ford and Fulkerson , Hu ) Note: The problem can be solved in O(n) time; for general planar networks an O(n log n)-algorithm has been found by Weihe . . Show that the directed edge-disjoint version of Mengera#39;s Theorem anbsp;...
|Author||:||Bernhard Korte, Jens Vygen|
|Publisher||:||Springer Science & Business Media - 2013-11-11|