A constant factor approximation algorithm for generalized MIN-sum set cover

MaRDI QIDQ5417729zbMATH OpenFDO

Authors N. Bansal, Anupam Gupta, Ravishankar Krishnaswamy

Publication date 22 May 2014

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1947050
• A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
• A note on the generalized min-sum set cover problem
• Approximating min sum set cover
• Preemptive and non-preemptive generalized min sum set cover

Cited in

(17)

• Efficient approximation of Min Set Cover by moderately exponential algorithms
• Approximating min sum set cover
• Preemptive and non-preemptive generalized min sum set cover
• Approximation algorithms for the geometric firefighter and budget fence problems
• A primal-dual approximation algorithm for min-sum single-machine scheduling problems
• A note on the generalized min-sum set cover problem
• scientific article; zbMATH DE number 1947050 (Why is no real title available?)
• Small extended formulation for knapsack cover inequalities from monotone circuits
• A General Framework for Approximating Min Sum Ordering Problems
• Adaptive submodular ranking and routing
• Precedence-Constrained Min Sum Set Cover
• Facility Location with Matroid or Knapsack Constraints
• A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
• Hardness and approximation of submodular minimum linear ordering problems
• On min sum vertex cover and generalized min sum set cover
• The online min-sum set cover problem
• On the approximability of multistage min-sum set cover

This page was built for publication: A constant factor approximation algorithm for generalized MIN-sum set cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417729)