Document Open Access Logo

Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position

Authors Anastasiia Tkachenko , Haitao Wang

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.STACS.2025.73.pdf
  • Filesize: 0.85 MB
  • 20 pages
HTML5 Logo HTML (experimental)
LIPIcs.STACS.2025.73.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Dominating set
  • k-center
  • geometric set cover
  • independent set
  • clique
  • vertex cover
  • unit-disk graphs
  • convex position
  • dispersion
  • maximally separated sets

Metrics

Abstract

Given a set P of n points in the plane, its unit-disk graph G(P) is a graph with P as its vertex set such that two points of P are connected by an edge if their (Euclidean) distance is at most 1. We consider several classical problems on G(P) in a special setting when points of P are in convex position. These problems are all NP-hard in the general case. We present efficient algorithms for these problems under the convex position assumption.
● For the problem of finding the smallest dominating set of G(P), we present an O(knlog n) time algorithm, where k is the smallest dominating set size. We also consider the weighted case in which each point of P has a weight and the goal is to find a dominating set in G(P) with minimum total weight; our algorithm runs in O(n³log² n) time. In particular, for a given k, our algorithm can compute in O(kn²log² n) time a minimum weight dominating set of size at most k (if it exists). 
● For the discrete k-center problem, which is to find a subset of k points in P (called centers) for a given k, such that the maximum distance between any point in P and its nearest center is minimized. We present an algorithm that solves the problem in O(min{n^{4/3}log n+knlog² n,k² nlog²n}) time, which is O(n²log² n) in the worst case when k = Θ(n). For comparison, the runtime of the current best algorithm for the continuous version of the problem where centers can be anywhere in the plane is O(n³ log n). 
● For the problem of finding a maximum independent set in G(P), we give an algorithm of O(n^{7/2}) time and another randomized algorithm of O(n^{37/11}) expected time, which improve the previous best result of O(n⁶log n) time. Our algorithms can be extended to compute a maximum-weight independent set in G(P) with the same time complexities when points of P have weights.  
- If we are looking for an (unweighted) independent set of size 3, we derive an algorithm of O(nlog n) time; the previous best algorithm runs in O(n^{4/3}log² n) time (which works for the general case where points of P are not necessarily in convex position). 
- If points of P have weights and are not necessarily in convex position, we present an algorithm that can find a maximum-weight independent set of size 3 in O(n^{5/3+δ}) time for an arbitrarily small constant δ > 0. By slightly modifying the algorithm, a maximum-weight clique of size 3 can also be found within the same time complexity. 
● For the dispersion problem, which is to find a subset of k points from P for a given k, such that the minimum pairwise distance of the points in the subset is maximized. We present an algorithm of O(n^{7/2}log n) time and another randomized algorithm of O(n^{37/11}log n) expected time, which improve the previous best result of O(n⁶) time.  
- If k = 3, we present an algorithm of O(nlog² n) time and another randomized algorithm of O(nlog n) expected time; the previous best algorithm runs in O(n^{4/3}log² n) time (which works for the general case where points of P are not necessarily in convex position).

Cite As Get BibTex

Anastasiia Tkachenko and Haitao Wang. Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 73:1-73:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.STACS.2025.73

Author Details

Anastasiia Tkachenko
  • Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA
Haitao Wang
  • Kahlert School of Computing, University of Utah, Salt Lake City, UT, USA

Funding

This research was supported in part by NSF under Grant CCF-2300356.

References

  1. Pankaj K. Agarwal, Esther Ezra, and Micha Sharir. Semi-algebraic off-line range searching and biclique partitions in the plane. In Proceedings of the 40th International Symposium on Computational Geometry (SoCG), pages 4:1-4:15, 2024. URL: https://doi.org/10.4230/LIPIcs.SoCG.2024.4.
  2. Pankaj K. Agarwal, Mark H. Overmars, and Micha Sharir. Computing maximally separated sets in the plane. SIAM Journal on Computing, 36(3):815-834, 2006. URL: https://doi.org/10.1137/S0097539704446591.
  3. Pankaj K. Agarwal, Micha Sharir, and Emo Welzl. The discrete 2-center problem. Discrete and Computational Geometry, 20:287-305, 1998. URL: https://doi.org/10.1007/PL00009387.
  4. Alok Aggarwal, Leonidas J. Guibas, James Saxe, and Peter W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete and Computational Geometry, 4:591-604, 1989. URL: https://doi.org/10.1007/BF02187749.
  5. Tetsuya Araki and Shin-ichi Nakano. Max-min dispersion on a line. Journal of Combinatorial Optimization, 44(3):1824-1830, 2022. URL: https://doi.org/10.1007/s10878-020-00549-5.
  6. Paul Balister, Béla Bollobás, Amites Sarkar, and Mark Walters. Connectivity of random k-nearest-neighbour graphs. Advances in Applied Probability, 37(1):1-24, 2005. URL: https://doi.org/doi:10.1239/aap/1113402397.
  7. Michael A. Bender and Martín Farach-Colton. The LCA problem revisited. In Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pages 88-94, 2000. URL: https://doi.org/10.1007/10719839_9.
  8. Sergei Bespamyatnikh and David G. Kirkpatrick. Rectilinear 2-center problems. In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG), 1999. URL: http://www.cccg.ca/proceedings/1999/fp55.pdf.
  9. Sergei Bespamyatnikh and Michael Segal. Rectilinear static and dynamic discrete 2-center problems. In Proceedings of the 6th Workshop on Algorithms and Data Structures (WADS), pages 276-287, 1999. URL: https://doi.org/10.1007/3-540-48447-7_28.
  10. Binay Bhattacharya, Ante Ćustić, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, and Naoki Katoh. Geometric p-center problems with centers constrained to two lines. In Proceedings of the 18th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCGG), pages 24-36, 2015. URL: https://doi.org/10.1007/978-3-319-48532-4_3.
  11. Timothy M. Chan. Geometric applications of a randomized optimization technique. Discrete and Computational Geometry, 22(4):547-567, 1999. URL: https://doi.org/10.1007/PL00009478.
  12. Timothy M. Chan. More planar two-center algorithms. Computational Geometry: Theory and Applications, 13:189-198, 1999. URL: https://doi.org/10.1016/S0925-7721(99)00019-X.
  13. Timothy M. Chan, Qizheng He, and Yuancheng Yu. On the fine-grained complexity of small-size geometric set cover and discrete k-center for small k. In Proceedings of th 50th International Colloquium on Automata, Languages, and Programming (ICALP), pages 34:1-34:19, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.34.
  14. Bernard Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete and Computational Geometry, 9(2):145-158, 1993. URL: https://doi.org/10.1007/BF02189314.
  15. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, Micha Sharir, and Emo Welzl. Improved bounds on weak ε-nets for convex sets. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pages 495-504, 1993. URL: https://doi.org/10.1145/167088.167222.
  16. Danny Z. Chen, Jian Li, and Haitao Wang. Efficient algorithms for the one-dimensional k-center problem. Theoretical Computer Science, 592:135-142, 2015. URL: https://doi.org/10.1016/j.tcs.2015.05.028.
  17. Kyungjin Cho, Eunjin Oh, Haitao Wang, and Jie Xue. Optimal algorithm for the planar two-center problem. In Proceedings of the 40th International Symposium on Computational Geometry (SoCG), pages 40:1-40:15, 2024. URL: https://doi.org/10.4230/LIPIcs.SoCG.2024.40.
  18. Jongmin Choi, Jaegun Lee, and Hee-Kap Ahn. Efficient k-center algorithms for planar points in convex position. In Proceedings of the 18th Algorithms and Data Structures Symposium (WADS), pages 262-274, 2023. URL: https://doi.org/10.1007/978-3-031-38906-1_18.
  19. Brent N. Clark, Charles J. Colbourn, and David S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165-177, 1990. URL: https://doi.org/10.1016/0012-365X(90)90358-O.
  20. Richard Cole. Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM, 34:200-208, 1987. URL: https://doi.org/10.1145/7531.7537.
  21. Gautam K. Das, Guilherme D. da Fonseca, and Ramesh K. Jallu. Efficient independent set approximation in unit disk graphs. Discrete Applied Mathematics, 280:63-70, 2020. URL: https://doi.org/10.1016/j.dam.2018.05.049.
  22. Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, and Susmita Sur-Kolay. Approximation algorithms for maximum independent set of a unit disk graph. Information Processing Letters, 115:439-446, 2015. URL: https://doi.org/10.1016/j.ipl.2014.11.002.
  23. Minati De and Abhiruk Lahiri. Geometric dominating-set and set-cover via local-search. Computational Geometry, 113(C):102007, 2023. URL: https://doi.org/10.1016/j.comgeo.2023.102007.
  24. David Eppstein. Faster construction of planar two-centers. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 131-138, 1997. URL: http://dl.acm.org/citation.cfm?id=314161.314198.
  25. David Eppstein. Graph-theoretic solutions to computational geometry problems. In Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pages 1-16, 2009. URL: https://doi.org/10.1007/978-3-642-11409-0_1.
  26. Jared Espenant, J. Mark Keil, and Debajyoti Mondal. Finding a maximum clique in a disk graph. In Proceedings of the 39th International Symposium on Computational Geometry (SoCG), pages 30:1-30:17, 2023. URL: https://doi.org/10.4230/LIPIcs.SoCG.2023.30.
  27. Matt Gibson and Imran A. Pirwani. Algorithms for dominating set in disk graphs: Breaking the log n barrier. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA), pages 243-254, 2010. URL: https://doi.org/10.1007/978-3-642-15775-2_21.
  28. Dov Harel and Robert E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338-355, 1984. URL: https://doi.org/10.1137/0213024.
  29. Wen-Lian Hsu and George L. Nemhauser. Easy and hard bottleneck location problems. Discrete Applied Mathematics, 1(3):209-215, 1979. URL: https://doi.org/10.1016/0166-218X(79)90044-1.
  30. Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, and Micha Sharir. Triangles and girth in disk graphs and transmission graphs. In Proceedings of the 27th Annual European Symposium on Algorithms (ESA), pages 64:1-64:14, 2019. URL: https://doi.org/10.4230/LIPIcs.ESA.2019.64.
  31. Richard M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, pages 85-103, 1972. URL: https://doi.org/10.1007/978-3-540-68279-0_8.
  32. Matthew J. Katz, Klara Kedem, and Michael Segal. Discrete rectilinear 2-center problems. Computational Geometry, 15(4):203-214, 2000. URL: https://doi.org/10.1016/S0925-7721(99)00052-8.
  33. Matthew J. Katz and Micha Sharir. An expander-based approach to geometric optimization. SIAM Journal on Computing, 26(5):1384-1408, 1997. URL: https://doi.org/10.1137/S0097539794268649.
  34. J. Mark Keil and Debajyoti Mondal. The maximum clique problem in a disk graph made easy. arXiv:2404.03751, 2024. URL: https://arxiv.org/abs/2404.03751, URL: https://doi.org/10.48550/arXiv.2404.03751.
  35. Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, and Katsuhisa Yamanaka. An O(n²)-time algorithm for computing a max-min 3-dispersion on a point set in convex position. IEICE Transactions on Information and Systems, 105(3):503-507, 2022. URL: https://doi.org/10.1587/transinf.2021FCP0013.
  36. Andrzej Lingas. On approximation behavior and implementation of the greedy triangulation for convex planar point sets. In Proceedings of the 2nd Annual Symposium on Computational Geometry (SoSG), pages 72-79, 1986. URL: https://doi.org/10.1145/10515.10523.
  37. Madhav V. Marathe, Heinz Breu, Harry B. Hunt III, Sekharipuram S. Ravi, and Daniel J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995. URL: https://doi.org/10.1002/net.3230250205.
  38. Tomomi Matsui. Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In Proceedings of the 2nd Japanese Conference on Discrete and Computational Geometry (JCDCG), pages 194-200, 1998. URL: https://doi.org/10.1007/978-3-540-46515-7_16.
  39. Nimrod Megiddo. Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM, 30(4):852-865, 1983. URL: https://doi.org/10.1145/2157.322410.
  40. Nimrod Megiddo. Linear-time algorithms for linear programming in R³ and related problems. SIAM Journal on Computing, 12(4):759-776, 1983. URL: https://doi.org/10.1137/0212052.
  41. Nabil H. Mustafa and Saurabh Ray. Improved results on geometric hitting set problems. Discrete and Computational Geometry, 44:883-895, 2010. URL: https://doi.org/10.1007/s00454-010-9285-9.
  42. Charles E. Perkins and Pravin Bhagwat. Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers. In Proceedings of the Conference on Communications Architectures, Protocols and Applications (SIGCOMM), pages 234-244, 1994. URL: https://doi.org/10.1145/190809.190336.
  43. Charles E. Perkins and Pravin Bhagwat. Ad-hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), pages 90-100, 1999. URL: https://doi.org/10.1109/MCSA.1999.749281.
  44. Dana S. Richards and Jeffrey S. Salowe. A rectilinear steiner minimal tree algorithm for convex point sets. In Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory (SWAT), volume 447, pages 201-212, 1990. URL: https://doi.org/10.1007/3-540-52846-6_90.
  45. Michael I. Shamos and Dan Hoey. Closest-point problems. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science (FOCS), pages 151-162, 1975. URL: https://doi.org/10.1109/SFCS.1975.8.
  46. Micha Sharir. A near-linear algorithm for the planar 2-center problem. Discrete and Computational Geometry, 18:125-134, 1997. URL: https://doi.org/10.1007/PL00009311.
  47. Vishwanath R. Singireddy, Manjanna Basappa, and Joseph S.B. Mitchell. Algorithms for k-dispersion for points in convex position in the plane. In Proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), pages 59-70, 2023. URL: https://doi.org/10.1007/978-3-031-25211-2_5.
  48. Kuo-Hui Tsai and Da-Wei Wang. Optimal algorithms for circle partitioning. In Proceedings of the Third Annual International Computing and Combinatorics Conference (COCOON), pages 304-310, 1997. URL: https://doi.org/10.1007/BFb0045097.
  49. Vijay V. Vazirani. Approximation Algorithms. Springer, Berlin Heidelberg, 1st edition, 2001. Google Scholar
  50. Da-Wei Wang and Yue-Sun Kuo. A study on two geometric location problems. Information processing letters, 28(6):281-286, 1988. URL: https://doi.org/10.1016/0020-0190(88)90174-3.
  51. Haitao Wang. On the planar two-center problem and circular hulls. Discrete and Computational Geometry, 68:1175-1226, 2022. URL: https://doi.org/10.1007/S00454-021-00358-5.
  52. Haitao Wang. Unit-disk range searching and applications. Journal of Computational Geometry, 14(1):343-394, 2023. URL: https://doi.org/10.20382/jocg.v14i1a13.
  53. Haitao Wang and Jingru Zhang. Line-constrained k-median, k-means, and k-center problems in the plane. International Journal of Computational Geometry and Application, 26(3):185-210, 2016. URL: https://doi.org/10.1142/S0218195916600049.
  54. Haitao Wang and Yiming Zhao. Improved algorithms for distance selection and related problems. In Proceedings of the 31st Annual European Symposium on Algorithms (ESA), pages 101:1-101:14, 2023. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.101.
  55. Frank Ángel Hernández Mira, Ernesto Parra Inza, José María Sigarreta Almira, and Nodari Vakhania. A polynomial-time approximation to a minimum dominating set in a graph. Theoretical Computer Science, 930:142-156, 2022. URL: https://doi.org/10.1016/j.tcs.2022.07.020.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact