433 search results - page 9 / 87 » A greedy approximation algorithm for the group Steiner probl... |
157
Voted
NIPS
2001
15 years 5 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
179
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
139
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
143
Voted
ICAC
2006
IEEE
15 years 10 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
139
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...