433 search results - page 27 / 87 » A greedy approximation algorithm for the group Steiner probl... |
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
MOR
2007
13 years 8 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
SIAMCOMP
1998
13 years 8 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
FCT
2007
Springer
14 years 2 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...