SODA
2010
ACM
14 years 1 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
SODA
2010
ACM
14 years 1 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
SODA
2010
ACM
14 years 1 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
SODA
2010
ACM
14 years 1 months ago
2010
ACM