Max-Min 3-Dispersion Problems

Takashi Horiyama, Shin ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Given a set P of n points on which facilities can be placed and an integer k, we want to place k facilities on some points so that the minimum distance between facilities is maximized. The problem is called the k-dispersion problem. In this paper we consider the 3-dispersion problem when P is a set of points on a plane. Note that the 2-dispersion problem corresponds to the diameter problem. We give an O(n) time algorithm to solve the 3-dispersion problem in the (forumala presented). metric, and an O(n) time algorithm to solve the 3-dispersion problem in the (forumala presented) metric. Also we give an (forumala presented) time algorithm to solve the 3-dispersion problem in the (forumala presented) metric.

本文言語English
ホスト出版物のタイトルComputing and Combinatorics - 25th International Conference, COCOON 2019, Proceedings
編集者Ding-Zhu Du, Zhenhua Duan, Cong Tian
出版社Springer Verlag
ページ291-300
ページ数10
ISBN(印刷版)9783030261757
DOI
出版ステータスPublished - 2019 1 1
イベント25th International Computing and Combinatorics Conference, COCOON 2019 - Xi'an, China
継続期間: 2019 7 292019 7 31

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11653 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference25th International Computing and Combinatorics Conference, COCOON 2019
CountryChina
CityXi'an
Period19/7/2919/7/31

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Max-Min 3-Dispersion Problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル