7150 search results - page 54 / 1430 » An Approximation Algorithm for Approximation Rank |
119
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
92
Voted
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
ALGORITHMICA
2010
15 years 20 days ago
2010
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...
STOC
2002
ACM
16 years 25 days ago
2002
ACM
110
Voted
NIPS
2004
15 years 1 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...