Sciweavers

1414 search results - page 4 / 283
» Cover Time and Broadcast Time
Sort
View
JCO
2010
182views more  JCO 2010»
13 years 8 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
SIROCCO
2008
13 years 11 months ago
Fast Radio Broadcasting with Advice
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between t...
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
ICDCS
2002
IEEE
14 years 2 months ago
Scheduling Real-Time Data Items In Multiple Channels And Multiple Receivers Environments
In the real-time environments, information is disseminated to clients with timing constraint. In this paper, we focus on the real time data scheduling problem in multiple broadcas...
Guanling Lee, Yi-Ning Pan, Arbee L. P. Chen
EUROPAR
2009
Springer
14 years 1 months ago
Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
CSR
2008
Springer
13 years 11 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma