3875 search results - page 155 / 775 » Approximation algorithms for the 0-extension problem |
130
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
175
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
136
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
134
click to vote
NETWORKS
2007
15 years 4 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
130
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...