1332 search results - page 14 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
121
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
122
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
150
Voted
COMPUTING
2008
15 years 3 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
116
click to vote
AAIM
2010
Springer
15 years 6 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
131
click to vote
MST
2006
15 years 3 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...