The following pages link to (Q4535021):
Displaying 19 items.
- Improved performance of the greedy algorithm for partial cover (Q293139) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- On the multi-radius cover problem (Q845720) (← links)
- Computing small partial coverings (Q1007552) (← links)
- On combinatorial approximation of covering 0-1 integer programs and partial set cover (Q1777420) (← links)
- On approximation of the submodular set cover problem (Q1969763) (← links)
- One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- Tight approximation bounds for combinatorial frugal coverage algorithms (Q2392738) (← links)
- Decision tree classification with bounded number of errors (Q2398501) (← links)
- Using homogeneous weights for approximating the partial cover problem (Q2729647) (← links)
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality (Q2851852) (← links)
- Approximation algorithms for union and intersection covering problems (Q2911608) (← links)
- Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) (Q3165942) (← links)
- (Q3585507) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)
