An approximation algorithm for the partial covering 0-1 integer program
From MaRDI portal
Publication:2297657
DOI10.1016/J.DAM.2017.08.024zbMATH Open1433.90087OpenAlexW2760684931MaRDI QIDQ2297657FDOQ2297657
Yotaro Takazawa, Tomonari Kitahara, Shinji Mizuno
Publication date: 20 February 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.08.024
Recommendations
- An improved approximation algorithm for the covering 0-1 integer program
- On combinatorial approximation of covering 0-1 integer programs and partial set cover
- On approximating (sparse) covering integer programs
- Approximation algorithms for covering/packing integer programs
- Approximation algorithms for partial covering problems
Cites Work
- Approximation algorithms for partial covering problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithm for partial positive influence problem in social network
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
- Primal-dual schema for capacitated covering problems
- On combinatorial approximation of covering 0-1 integer programs and partial set cover
- Local ratio method on partial set multi-cover
Cited In (7)
- An improved approximation algorithm for the partial Latin square extension problem.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for the covering-type \(k\)-violation linear program
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- One for the price of two: a unified approach for approximating covering problems
- On combinatorial approximation of covering 0-1 integer programs and partial set cover
This page was built for publication: An approximation algorithm for the partial covering 0-1 integer program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297657)
