179 search results - page 15 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
FOCM
2002
14 years 11 months ago
2002
Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
COMPGEOM
1999
ACM
15 years 3 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
COMPGEOM
2009
ACM
15 years 5 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
STOC
2000
ACM
15 years 3 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
106
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...