COMPGEOM
2009
ACM
14 years 6 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
COMPGEOM
2009
ACM
14 years 6 months ago
2009
ACM
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
COMPGEOM
2009
ACM
14 years 6 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...
COMPGEOM
2009
ACM
14 years 6 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
SLS
2009
Springer
14 years 6 months ago
2009
Springer
SLS
2009
Springer
14 years 6 months ago
2009
Springer
SLS
2009
Springer
14 years 6 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...
SLS
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
SLS
2009
Springer
14 years 6 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
SLS
2009
Springer
14 years 6 months ago
2009
Springer