Sciweavers

3192 search results - page 174 / 639
» The minimum latency problem
Sort
View
ICDCS
2008
IEEE
15 years 10 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
151
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
Di Wang, Alhussein A. Abouzeid
GLOBECOM
2006
IEEE
15 years 10 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 4 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
ICCS
2004
Springer
15 years 9 months ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo