Minimum-Cost Mixed Graph Covers with Targeted Weight Constraints
- 4 February 2026
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 70 (1) , 4
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
- Natural Science Foundation of Beijing Municipality
This publication has 18 references indexed in Scilit:
- Mixed Graph Covering with Target Constraints2025
- Approximation Algorithm for Vertex Cover with Multiple Covering ConstraintsAlgorithmica, 2021
- The Approximability of Partial Vertex Covers in Trees2017
- Primal-Dual Schema for Capacitated Covering Problems2008
- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated GuessesAlgorithmica, 2007
- Approximation Algorithms2003
- Using Homogeneous Weights for Approximating the Partial Cover ProblemJournal of Algorithms, 2001
- Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem1998
- The t-vertex cover problem: Extending the half integrality framework with budget constraints1998
- Reducibility among Combinatorial Problems1972