Author:
Akagi Toshihiro,Araki Tetsuya,Horiyama Takashi,Nakano Shin-ichi,Okamoto Yoshio,Otachi Yota,Saitoh Toshiki,Uehara Ryuhei,Uno Takeaki,Wasa Kunihiro
Publisher
Springer International Publishing
Reference25 articles.
1. Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. Comput. Surv. 30, 412–458 (1998)
2. Akagi, T., Nakano, S.: Dispersion on the line, IPSJ SIG Technical reports, 2016-AL-158-3 (2016)
3. Lecture Notes in Computer Science;C Baur,1998
4. Birnbaum, B., Goldman, K.J.: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 50, 42–59 (2009)
5. Cevallos, A., Eisenbrand, F., Zenklusen, R.: Max-sum diversity via convex programming. In: Proceedings of SoCG 2016, pp. 26:1–26:14 (2016)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dispersion problem on a convex polygon;Information Processing Letters;2025-01
2. Dispersion in a Polygon;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-09-01
3. Max-Min Diversification with Asymmetric Distances;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
4. Algorithms for k-Dispersion for Points in Convex Position in the Plane;Algorithms and Discrete Applied Mathematics;2023
5. Away from Each Other;WALCOM: Algorithms and Computation;2023