500 search results - page 19 / 100 » Approximation algorithms for maximum independent set of pseu... |
128
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
140
Voted
MOR
2000
15 years 1 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
153
click to vote
BMCBI
2010
14 years 8 months ago
2010
Background: The development, in the last decade, of stochastic heuristics implemented in robust application softwares has made large phylogeny inference a key step in most compara...
114
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
162
Voted
COCOON
2004
Springer
15 years 7 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...