Author:
Araki Tetsuya,Nakano Shin-ichi
Publisher
Springer International Publishing
Reference18 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;T Akagi,2018
4. Lecture Notes in Computer Science;C Baur,1998
5. Birnbaum, B., Goldman, K.J.: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 50, 42–59 (2009)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An <i>O</i>(<i>n</i><sup>2</sup>)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position;IEICE Transactions on Information and Systems;2022-03-01
2. Max-Min 3-Dispersion Problems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021-09-01
3. Efficient Algorithms for the Partial Sum Dispersion Problem;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2020-10-01
4. Max–min dispersion on a line;Journal of Combinatorial Optimization;2020-02-25