Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Power consumption in packet radio networks
Theoretical Computer Science
Steiner points in tree metrics don't (really) help
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
In this paper we theoretically study the MINIMUM RANGE ASSIGNMENT problem in static ad-hoc networks with arbitrary structure, where the transmission distances can violate triangle inequality. We consider two versions of the MINIMUM RANGE ASSIGNMENT problem, where the communication graph has to fulfill either the h-strong connectivity condition (MIN-RANGE(h-SC)) or the h-broadcast condition (MIN-RANGE(h-B)). Both homogeneous and non-homogeneous cases are studied. By approximating arbitrary edge-weighted graphs by paths, we present probabilistic O(logn)-approximation algorithms for MIN-RANGE(h-SC)and MIN-RANGE(h-B), which improves the previous best ratios O(lognloglogn) and O(n^2lognloglogn), respectively [D. Ye, H. Zhang, The range assignment problem in static ad-hoc networks on metric spaces, Proceedings of the 11th Colloquium on Structural Information and Communication Complexity, Sirocco 2004, Lecture Notes in Computer Science, vol. 3104, pp. 291-302]. The result for MIN-RANGE(h-B)matches the lower bound [G. Rossi, The range assignment problem in static ad-hoc wireless networks. Ph.D. Thesis, 2003] for the case that triangle inequality for transmission distance holds (which is a special case of our model). Furthermore, we show that if the network fulfils certain property and the distance power gradient @a is sufficiently small, the approximation ratio is improved to O((loglogn)^@a). Finally we discuss the applications of our algorithms in mobile ad-hoc networks.