In Proceedings of International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2003. In Proceedings of Mobile Computing and Networking (MOBICOM), 2003. Geographic Routing without Location Information. In Proceedings of Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2002. Predicting Internet Network Distance with Coordinates-based Approaches. In Proceedings of 2nd Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2004. Virtual Coordinates for Ad hoc and Sensor Networks. In Proceedings of $\mathit 3 ^ rd $ Ad-Hoc, Mobile, and Wireless Networks: Third International Conference (ADHOC-NOW), pages 158-171, 2004. Range-Free Ranking in Sensors Networks and Its Applications to Localization. In Proceedings of $\mathit 1 ^ st $ Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 69-78. In Proceedings of Symposium on Principles of Distributed Computing (PODC), 2003. Geometric Ad-Hoc Routing: Of Theory and Practice. Computers and Intractability, A Guide to the Theory of NP-Completeness. Practical, Distributed Network Coordinates. In Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), 1999. Routing with Guaranteed Delivery in Ad hoc Wireless Networks. In Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 19-27. Robust Position-based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges. Tsai, Y.-T., Lin, Y.-L., Hsu, F.R.: The online firstfit algorithm for radio frequency assignment problems. Wang, D., Kuo, Y.-S.: A study on two geometric location problems. Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. rep., Department of Economics, Tilburg University (1991) Peeters, R.: On coloring j-unit sphere graphs. Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. ![]() PhD thesis, Technical University of Berlin, Germany (1997) Malesińska, E.: Graph theoretical models for frequency assignment problems. Koebe, P.: Kontaktprobleme der konformen Abbildung. HuntIII, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP and PSPACE-hard problems for geometric graphs. Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. Hliněný, P., Kratochvíl, J.: Representing graphs by disks and balls. ![]() A graph is a unit disk graph if and only if. Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. In this paper we consider intersection graphs of regular polygons, emphasizing intersection graphs of unit disks. Gräf, A., Stumpf, M., Weisenfels, G.: On coloring unit disk graphs. 671–679 (2001)įiala, J., Fishkin, A.V., Fomin, F.: Off-line and on-line distance constrained labeling of disk graphs. In: Proceedings the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington, DC, January 7-9, pp. Computational Geometry: Theory and Applications 23(2), 243–255 (2002)Įrlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. Discrete Mathematics 86, 165–177 (1990)Įrlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks (2001) (manuscript)Įrlebach, T., Fiala, J.: On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications 9, 3–24 (1998)Ĭlark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. PhD thesis, University of british Columbia (1996)īreu, H., Kirkpatrick, D.G.: Unit disc graph recognition is NP-hard. Journal of the ACM 41, 153–180 (1994)īreu, H.: Algorithmic Aspects of constrained unit disk graphs. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004) (to appear)īaker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Agarwal, P.K., Overmars, M., Sharir, M.: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |