A Unified Approach to Approximating Partial Covering Problems

By Jochen Könemann, Ojas D. Parekh, D. Segev. 2006

98 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Organizational Behavior and Human Resource Management

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Robert Tibshirani
2. Jacob Bien

In Computer Graphics and Computer-Aided Design

1. Robert Tibshirani
2. Jacob Bien

In Organizational Behavior and Human Resource Management

1. Robert Tibshirani
2. Jacob Bien

Citations in the corpus

• Classification by Set Cover: The Prototype Vector Machine (2009, methodology): “For this reason, we adopt a prize-collecting set cover framework for our problem (i.e., we assign a cost to each covering set, a penalty for being uncovered to each point, and then find the minimum-cost partial cover, Könemann et al. 2006).”