Approximation algorithms for the covering-type k-violation linear program
From MaRDI portal
Publication:2329669
Recommendations
- k-violation linear programming
- scientific article; zbMATH DE number 686977
- Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
- Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
- Covering linear programming with violations
- scientific article; zbMATH DE number 4215407
- Approximating covering integer programs with multiplicity constraints
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- A new approximation algorithm for k-set cover problem
- Primal-dual approximation algorithms for submodular vertex cover problems with linear/submodular penalties
Cites work
- k-violation linear programming
- Algorithms for facility location problems with outliers. (Extended abstract)
- An approximation algorithm for the partial covering 0-1 integer program
- Approximation algorithms for partial covering problems
- Covering linear programming with violations
- scientific article; zbMATH DE number 5764796 (Why is no real title available?)
- Local ratio method on partial set multi-cover
- Low-Dimensional Linear Programming with Violations
- Packing interdiction and partial covering problems
- Relaxations and approximations of chance constraints under finite distributions
This page was built for publication: Approximation algorithms for the covering-type \(k\)-violation linear program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329669)