Sciweavers

32 search results - page 2 / 7
» Optimal broadcast domination in polynomial time
Sort
View
DAM
2006
88views more  DAM 2006»
13 years 4 months ago
Domination analysis for minimum multiprocessor scheduling
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
Gregory Gutin, Tommy R. Jensen, Anders Yeo
MDM
2004
Springer
138views Communications» more  MDM 2004»
13 years 10 months ago
Optimizing Data Placement over Wireless Broadcast Channel for Multi-Dimensional Range Query Processing
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
Jianting Zhang, Le Gruenwald
EUROPAR
2009
Springer
13 years 8 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, ...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
13 years 11 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
FSTTCS
2004
Springer
13 years 10 months ago
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
Srinivasan Parthasarathy 0002, Rajiv Gandhi