Sciweavers

297 search results - page 17 / 60
» On the Fastest Vickrey Algorithm
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 8 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
COMPGEOM
2011
ACM
12 years 11 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
FCT
2001
Springer
13 years 12 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
ICALP
2010
Springer
13 years 9 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...