Max–min dispersion on a line-Reference-Cited by-同舟云学术

Max–min dispersion on a line

Published:2020-02-25 Issue: Volume: Page:
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Araki Tetsuya,Nakano Shin-ichi^ORCID

Funder

Kakenhi

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-020-00549-5.pdf

Reference19 articles.

1. Agarwal P, Sharir M (1998) Efficient algorithms for geometric optimization. Comput Surv 30:412–458

2. Akagi T, Nakano S (2016) Dispersion on the line, IPSJ SIG Technical Reports, 2016-AL-158-3

3. Akagi T, Araki T, Horiyama T, Nakano S, Okamoto Y, Otachi Y, Saitoh T, Uehara R, Uno T, Wasa K (2018) Exact algorithms for the max–min dispersion problem. In: Proceedings of FAW 2018, vol 10823. LNCS, pp 263–272

4. Araki T, Nakano S (2018) The max–min dispersion on a line. In: Proceedings of COCOA 2018, vol 11346. LNCS, pp 672–678

5. Baur C, Fekete SP (1998) Approximation of geometric dispersion problems. In: Proceedings of APPROX 1998, pp 63–75

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Dispersion in a Polygon;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-09-01

2. Algorithms for k-Dispersion for Points in Convex Position in the Plane;Algorithms and Discrete Applied Mathematics;2023

3. Away from Each Other;WALCOM: Algorithms and Computation;2023

4. Dispersion on Intervals;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01

5. The Bound Coverage Problem by Aligned Disks in $$L_1$$ Metric;Lecture Notes in Computer Science;2022