Sciweavers

Share
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
9 years 10 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
9 years 10 months ago
Declaring independence via the sketching of sketches
Piotr Indyk, Andrew McGregor
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
9 years 10 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
9 years 10 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
9 years 10 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
9 years 10 months ago
Maintaining deforming surface meshes
We present a method to maintain a mesh approximating a deforming surface, which is specified by a dense set of sample points. We identify a reasonable motion model for which a pro...
Siu-Wing Cheng, Tamal K. Dey
SODA
2008
ACM
79views Algorithms» more  SODA 2008»
9 years 10 months ago
Computing excluded minors
Isolde Adler, Martin Grohe, Stephan Kreutzer
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
9 years 10 months ago
On stars and Steiner stars
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
Adrian Dumitrescu, Csaba D. Tóth
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
9 years 10 months ago
Metric clustering via consistent labeling
Robert Krauthgamer, Tim Roughgarden
books