562 search results - page 77 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
128
click to vote
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
123
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
109
click to vote
SODA
1997
ACM
15 years 2 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
115
click to vote
JNW
2008
15 years 1 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
STOC
1998
ACM
15 years 5 months ago
1998
ACM
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...