7150 search results - page 50 / 1430 » An Approximation Algorithm for Approximation Rank |
161
click to vote
NIPS
2001
15 years 6 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...
115
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
145
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
140
click to vote
AAIM
2008
Springer
15 years 11 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...