Sciweavers

4903 search results - page 15 / 981
» The Set Covering Machine
Sort
View
MP
2010
100views more  MP 2010»
13 years 6 months ago
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...
Mohit Tawarmalani, Jean-Philippe P. Richard, Kwang...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 2 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
STOC
2005
ACM
89views Algorithms» more  STOC 2005»
14 years 8 months ago
Universal approximations for TSP, Steiner tree, and set cover
Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 5 months ago
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...