Covering problems with hard capacities

This publication has 15 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• Dependent rounding in bipartite graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Generalized submodular cover problems and applications
  Theoretical Computer Science, 2001
• Tight approximation results for general covering integer programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2001
• Facility location with nonuniform hard capacities
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2001
• An analysis of the greedy algorithm for the submodular set covering problem
  Combinatorica, 1982
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
  SIAM Journal on Computing, 1982
• Covering, Packing and Knapsack Problems
  Annals of Discrete Mathematics, 1979
• Set Partitioning: A survey
  SIAM Review, 1976
• On the ratio of optimal integral and fractional covers
  Discrete Mathematics, 1975