Sciweavers

1082 search results - page 5 / 217
» Approximation Algorithms for Spreading Points
Sort
View
CORR
2008
Springer
55views Education» more  CORR 2008»
13 years 7 months ago
Faster Approximate Lossy Generalized Flow via Interior Point Algorithms
Samuel I. Daitch, Daniel A. Spielman
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
14 years 1 months ago
Approximating Largest Convex Hulls for Imprecise Points
Maarten Löffler, Marc J. van Kreveld
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 5 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
COMPGEOM
2009
ACM
14 years 2 months ago
Approximate center points with proofs
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...
Gary L. Miller, Donald Sheehy