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. Geom.Alber J, Fiala J (2004) Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. Yan, C., Xiang, Y., Dragan, F.F.: Compact and low delay routing labeling scheme for unit disk graphs. In: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. Thorup, M., Zwick, U.: Compact routing schemes. Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Santoro, N., Khatib, R.: Labelling and implicit routing in networks. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. Roditty, L., Tov, R.: New routing techniques and their applications. Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. Cambridge University Press, Cambridge (2007) Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn. Mitchell, J.S.B., Mulzer, W.: Proximity algorithms. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM), pp.
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. Gupta, A., Kumar, A., Rastogi, R.: Traveling with a Pez dispenser (or, routing issues in MPLS). Giordano, S., Stojmenovic, I.: Position based routing algorithms for ad hoc networks: a taxonomy. Gao, J., Zhang, L.: Well-separated pair decomposition for the unit-disk graph metric and its applications. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. Springer, Berlin (2008)įraigniaud, P., Gavoille, C.: Routing in trees. MIT Press, Cambridge (2009)ĭe Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry Algorithms and Applications, 3rd edn. In: Proceedings of the 32nd ACM Symposium on Principles of Distributed Computing (PODC), pp. ACM 42(1), 67–90 (1995)Ĭhechik, S.: Compact routing schemes with improved stretch. 7(6), 609–616 (2001)Ĭallahan, P., Kosaraju, S.: A decomposition of multidimensional point sets with applications to \(k\)-nearest-neighbors and \(n\)-body potential fields. The header size is \(O(\log n \log D)\) bits.īose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks.
0 kommentar(er)
