7006 search results - page 13 / 1402 » Approximation Algorithms |
137
click to vote
AAIM
2008
Springer
15 years 10 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...
115
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...