3874 search results - page 126 / 775 » Approximation Algorithms for k-hurdle Problems |
138
click to vote
COLOGNETWENTE
2010
15 years 9 days ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
100
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
107
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
109
click to vote
ISSAC
1995
Springer
15 years 5 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
151
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...