Sciweavers

29 search results - page 2 / 6
» soda 1997
Sort
View
SODA
1997
ACM
98views Algorithms» more  SODA 1997»
13 years 10 months ago
The k-Client Problem
Houman Alborzi, Eric Torng, Patchrawat Uthaisombut...
SODA
1997
ACM
83views Algorithms» more  SODA 1997»
13 years 10 months ago
Experimental Study of Minimum Cut Algorithms
Chandra Chekuri, Andrew V. Goldberg, David R. Karg...
DEXAW
1997
IEEE
97views Database» more  DEXAW 1997»
14 years 23 days ago
Conceptual Modelling for Invoice Document Processing
Francesca Cesarini, Enrico Francesconi, Simone Mar...
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 10 months ago
Faster Construction of Planar Two-Centers
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
David Eppstein
SODA
1998
ACM
88views Algorithms» more  SODA 1998»
13 years 10 months ago
Fast Distributed Algorithms for {Brooks-Vizing} Colourings
d Abstract) David A. Grable Alessandro Panconesi BRICS Report Series RS-97-37 ISSN 0909-0878 December 1997
David A. Grable, Alessandro Panconesi