Recommendations
- Approximating min sum set cover
- Set-cover approximation
- scientific article; zbMATH DE number 784428
- On the differential approximation of MIN SET COVER
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- A constant factor approximation algorithm for generalized MIN-sum set cover
- A note on the generalized min-sum set cover problem
- SOFSEM 2005: Theory and Practice of Computer Science
- Approximating set multi-covers
Cited in
(18)- Efficient approximation of Min Set Cover by moderately exponential algorithms
- PASS approximation: a framework for analyzing and designing heuristics
- Preemptive and non-preemptive generalized min sum set cover
- The minimum-entropy set cover problem
- Preemptive and non-preemptive generalized min sum set cover
- All-norms and all-L_p-norms approximation algorithms
- A note on the generalized min-sum set cover problem
- Some algorithmic results for [2]-sumset covers
- scientific article; zbMATH DE number 784428 (Why is no real title available?)
- A General Framework for Approximating Min Sum Ordering Problems
- Precedence-Constrained Min Sum Set Cover
- Database Theory - ICDT 2005
- A constant factor approximation algorithm for generalized MIN-sum set cover
- Algorithms – ESA 2005
- Algorithms and Computation
- Improved approximations for min sum vertex cover and generalized min sum set cover
- Some results on approximability of minimum sum vertex cover
- On min sum vertex cover and generalized min sum set cover
This page was built for publication: Approximating min-sum set cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411280)
