Sciweavers

Share
CORR
2012
Springer
195views Education» more  CORR 2012»
8 years 6 months ago
Multiple-Source Shortest Paths in Embedded Graphs
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
Sergio Cabello, Erin W. Chambers, Jeff Erickson
COMGEO
2002
ACM
9 years 10 months ago
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
Daniel Freedman
SODA
2010
ACM
426views Algorithms» more  SODA 2010»
10 years 7 months ago
Shape Replication Through Self-Assembly and RNase Enzymes
We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will re...
Zachary Abel, Nadia Benbernou, Mirela Damian, Erik...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
10 years 7 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
SODA
2010
ACM
241views Algorithms» more  SODA 2010»
10 years 7 months ago
A Model of Computation for MapReduce
Howard Karloff, Siddharth Suri, Sergei Vassilvitsk...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
10 years 7 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
10 years 7 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
10 years 7 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
10 years 7 months ago
Road Network Reconstruction for Organizing Paths
We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions...
Daniel Chen, Leonidas J. Guibas, John Hershberger,...
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
10 years 7 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
books