A polynomial-time 8/3-approximation algorithm is given for the new RMVCI bilevel problem under matroid constraints by relaxing the follower's NP-hard response to an LP with 4/3 integrality gap and shifting to vertex distributions.
Operations Research69(1), 82–99 (2021)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
A polynomial-time 8/3-approximation algorithm is given for the new RMVCI bilevel problem under matroid constraints by relaxing the follower's NP-hard response to an LP with 4/3 integrality gap and shifting to vertex distributions.