1941 search results - page 340 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
110
click to vote
CONEXT
2005
ACM
14 years 11 months ago
2005
ACM
In recent years, much work has been done on attempting to scale multicast data transmission to hundreds or thousands of receivers. There are, however, many situations where an app...
IFE
2007
14 years 9 months ago
2007
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
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...