scientific article; zbMATH DE number 7561397

DOI10.4230/LIPIcs.ISAAC.2018.43MaRDI QIDQ5091035

Eunpyeong Hong, Mong-Jen Kao

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmvertex covermultiple cover constraints

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

Algorithms for covering multiple submodular constraints and applications, Tight approximation for partial vertex cover with hard capacities

Cites Work

• Unnamed Item
• Approximation algorithms for the partition vertex cover problem
• An analysis of the greedy algorithm for the submodular set covering problem
• On approximation of the submodular set cover problem
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• Using Homogeneous Weights for Approximating the Partial Cover Problem
• Covering Problems with Hard Capacities
• Approximation algorithms for partial covering problems
• Applications of approximation algorithms to cooperative games
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques