Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem

Mark Velednitsky, Dorit S. Hochbaum. Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. In Donghyun Kim 0001, R. N. Uma, Alexander Zelikovsky, editors, Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Volume 11346 of Lecture Notes in Computer Science, pages 624-639, Springer, 2018. [doi]

Abstract

Abstract is missing.