433 search results - page 9 / 87 » A greedy approximation algorithm for the group Steiner probl... |
NIPS
2001
13 years 8 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...
MFCS
2005
Springer
14 years 26 days 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...
SODA
2008
ACM
13 years 8 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...
ICAC
2006
IEEE
14 years 1 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...
STOC
2005
ACM
14 years 7 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...