Abstract
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in ℝ2 and ℝ3. We present new reductions for the Connectivity problem, which are easily adapted to suit the other two problems. All reductions are considerably simpler than the technically quite involved ones used in earlier works on these problems. Using our constructions, we can for the first time prove NP-hardness of these problems for all real distance-power gradients α > 0 (resp. α > 1 for Broadcast) in 2-d, and prove APX-hardness of all three problems in 3-d for allα > 1. Our reductions yield improved lower bounds on the approximation ratios for all problems where APX-hardness was known before already. In particular, we derive the overall first APX-hardness proof for Broadcast. This was an open problem posed in earlier work in this area, as was the question whether (Strong) Connectivity remains NP-hard for α = 1. Additionally, we give the first hardness results for so-called well-spread instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, B.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. Journal of the ACM 41(1), 153–180 (1994)
Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. In: Proc. 26th ICALP, pp. 200–209 (1999), Also available as ECCC Report TR98-065 at http://eccc.uni-trier.de/eccc/
Călinescu, G., Măndoiu, I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc. IFIP TCS, vol. 223, pp. 119–130 (2002)
Chlebík, M., Chlebíková, J.: Inapproximability results for bounded variants of optimization problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 27–38. Springer, Heidelberg (2003), Also available as ECCC Report TR03-026
Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-Case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome “Tor Vergata”, Math. Department (2001)
Clementi, A., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.: Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE), pp. 23–38 (2002)
Clementi, A., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications 9(2), 125–140 (2004), Also available as ECCC Report TR00-054
Eades, P., Stirk, C., Whitesides, S.: The techniques of Kolmogorov and Bardzin for three-dimensional orthogonal graph drawings. Information Processing Letters 60(2), 97–103 (1996)
Garey, M., Johnson, D.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM Journal of Applied Mathematics 32(4), 826–834 (1977)
Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-Complete Problems. Theoretical Computer Science 1, 237–267 (1976)
Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103 (1972)
Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Pahlavan, K., Levesque, A.: Wireless Information Networks. Wiley-Interscience, Hoboken (1995)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)
Rossi, G.: The Range Assignment Problem in Static Ad-Hoc Wireless Networks (PhD-thesis), University of Siena (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fuchs, B. (2006). On the Hardness of Range Assignment Problems. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_15
Download citation
DOI: https://doi.org/10.1007/11758471_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)