Approximation Algorithms for Capacitated Rectangle Stabbing

This publication has 7 references indexed in Scilit:

• Covering problems with hard capacities
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
  Published by Springer Nature ,2003
• Capacitated vertex covering
  Journal of Algorithms, 2003
• Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
  Journal of Algorithms, 2002
• Generalized submodular cover problems and applications
  Theoretical Computer Science, 2001
• Approximation algorithms for hitting objects with straight lines
  Discrete Applied Mathematics, 1991
• An analysis of the greedy algorithm for the submodular set covering problem
  Combinatorica, 1982