Related papers
New algorithm solves resource limitations in practical scenarios with hard capacities.
The article discusses how to solve vertex cover and set cover problems with limited resources. The researchers found a 3-approximation algorithm for unweighted vertex cover with hard capacities. They also showed that weighted vertex cover is as difficult as set cover. A logarithmic approximation factor was proven for both set cover and weighted vertex cover with hard capacities.