Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
Open Access
- 14 April 2020
- book chapter
- Published by Springer Nature
- p. 27-39
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphsMathematical Programming, 2015
- Multi-parameter Minimum Spanning Trees2000
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- Algorithmic Geometry1998
- Algorithms and complexity analysis for some flow problemsAlgorithmica, 1994
- Maximizing Concave Functions in Fixed Dimension1993
- A deterministic view of random sampling and its use in geometryCombinatorica, 1990
- The upper envelope of piecewise linear functions: Algorithms and applicationsDiscrete & Computational Geometry, 1989
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983