Abstract
The parametric global minimum cut problem concerns a graph [Formula Presented] where the cost of each edge is an affine function of a parameter [Formula Presented] for some fixed dimension d. We consider the problems of finding the next breakpoint in a given direction, and finding a parameter value with maximum minimum cut value. We develop strongly polynomial algorithms for these problems that are faster than a naive application of Megiddo’s parametric search technique. Our results indicate that the next breakpoint problem is easier than the max value problem.
Author supplied keywords
Cite
CITATION STYLE
Aissi, H., McCormick, S. T., & Queyranne, M. (2020). Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12125 LNCS, pp. 27–39). Springer. https://doi.org/10.1007/978-3-030-45771-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
