Sciweavers

1972 search results - page 46 / 395
» connection 2008
Sort
View
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 1 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
16 years 1 months ago
Maintaining Connectivity in Dynamic Multimodal Network Models
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
15 years 1 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
CDC
2008
IEEE
122views Control Systems» more  CDC 2008»
15 years 6 months ago
On the number of leaders needed to ensure network connectivity
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
Dimos V. Dimarogonas, Tove Gustavi, Magnus Egerste...
CISS
2008
IEEE
15 years 6 months ago
Achieving network stability and user fairness through admission control of TCP connections
—This paper studies a network under TCP congestion control, in which the number of flows per user is explicitly taken into account. We present a control law for this variable th...
Andrés Ferragut, Fernando Paganini