49 search results - page 6 / 10 » Approximation and Complexity of k-Splittable Flows |
111
click to vote
NETWORKS
2010
14 years 10 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
101
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
149
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
COMCOM
2006
14 years 11 months ago
2006
We assess the state of Internet congestion control and error recovery through a controlled study that considers the integration of standards-track TCP error recovery and both TCP ...
165
click to vote
PDPTA
2010
14 years 9 months ago
2010
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...