7150 search results - page 61 / 1430 » An Approximation Algorithm for Approximation Rank |
102
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
121
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
106
Voted
CIAC
2000
Springer
15 years 4 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
124
Voted
RSCTC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We introduce an automated multi-spectral MRI segmentation technique based on approximate reducts derived from the data mining paradigm of the theory of rough sets. We uti...
107
click to vote
CORR
2007
Springer
15 years 16 days ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...