Sciweavers

SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 6 months ago
On clustering to minimize the sum of radii
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 6 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
SODA
2008
ACM
85views Algorithms» more  SODA 2008»
13 years 6 months ago
L(2, 1)-labelling of graphs
Frédéric Havet, Bruce A. Reed, Jean-...
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 6 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
SODA
2008
ACM
133views Algorithms» more  SODA 2008»
13 years 6 months ago
On the connectivity of dynamic random geometric graphs
Josep Díaz, Dieter Mitsche, Xavier Pé...
SODA
2008
ACM
76views Algorithms» more  SODA 2008»
13 years 6 months ago
Non-clairvoyant scheduling with precedence constraints
Julien Robert, Nicolas Schabanel
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 6 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...