Proc Cambridge Philos Soc 37:194–197īutenko S, Cheng X, Du DZ, Pardalos P (2003) On the construction of virtual backbone for ad hoc wireless networks. Comput Geometr Theory Applīrooks RL (1941) On coloring the nodes of a network. University of British Columbiaīreu H, Kirkpatrick DG (1998) Unit disk graph recognition is NP-hard. In Proceedings of the (1999) International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99) p 310īreu H (1996) Algorithmic Aspects of Constrained Unit Disk Graphs, PhD thesis. Ann Discret Math 25:27–46īasagni S (1999) Distributed clustering for ad hoc networks. In: STOC '82: Proceeding of the Fourteenth Annual ACM Symposium on Theory of Computing, pp 303–309īar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Spinger, New York, pp 865–890īar-Yehuda R, Even S (1982) On approximating a vertex cover for planar graphs. In: Resende MGC, Pardalos PM (eds) Handbook of Optimization in Telecommunications. J ACM 41(1):153–180īalasundaram B, Butenko S (2006) Graph domination, coloring and cliques in telecommunications. pp 3–14īaker BS (1994) Approximation algorithms for NP‑complete problems on planar graphs. In: Diaz J, Jansen K, Rolim JDP, Zwick U (eds) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques vol 4110 of Lecture Notes in Computer Science. J Commun Netw 4:22–29Īmbühl C, Erlebach T, Mihal'ák M, Nunkesser M (2006) Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. J Algorithm 52(2):134–151Īlzoubi KM, Wan PJ, Frieder O (2002) Distributed heuristics for connected dominating sets in wireless ad hoc networks. Alber J, Fiala J (2004) Geometric separation and exact solutions for the parameterized independent set problem on disk graphs.
0 Comments
Leave a Reply. |