Authors give a surrogate-based 2-approximation algorithm for the randomized max-vertex-coverage interdiction problem under general matroid constraints together with a 4/3-approximation for the follower's matroid-constrained max-vertex-coverage problem.
In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC)
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-Coverage Interdiction under Matroid Constraints
Authors give a surrogate-based 2-approximation algorithm for the randomized max-vertex-coverage interdiction problem under general matroid constraints together with a 4/3-approximation for the follower's matroid-constrained max-vertex-coverage problem.