Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid


We present a new algorithm for the problem of determining the intersection of a half-line Δu = {x ∈ IR | x = λu for λ ≥ 0} with a polymatroid. We then propose a second algorithm which generalizes the first algorithm and solves a parametric linear program. We prove that these two algorithms are strongly polynomial and that their running time is O(n + γn… (More)
DOI: 10.1007/978-3-540-76796-1_5


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.