论文信息 - Computing and Combinatorics

Computing and Combinatorics

In this paper, we consider time-space trade-offs for reporting a triangulation of points in the plane. The goal is to minimize the amount of working space while keeping the total running time small. We present the first multi-pass algorithm on the problem that returns the edges of a triangulation with their adjacency information. This even improves the previously best known random-access algorithm.

Moni Naor | Josef Kittler | John C. Mitchell

[1] Shuji Kijima,et al. An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution , 2015, Algorithmica.

[2] David Gamarnik,et al. Simple deterministic approximation algorithms for counting matchings , 2007, STOC '07.

[3] D. Gamarnik,et al. Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models , 2008 .

[4] Daniel Dadush,et al. Near-optimal deterministic algorithms for volume computation via M-ellipsoids , 2012, Proceedings of the National Academy of Sciences.