|
|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/15857
|
| Title: | Exact Algorithms for the Max-Min Dispersion Problem |
| Authors: | Akagi, Toshihiro
Araki, Tetsuya
Horiyama, Takashi
Nakano, Shin-Ichi
Okamoto, Yoshio
Otachi, Yota
Saitoh, Toshiki
Uehara, Ryuhei
Uno, Takeaki
Wasa, Kunihiro |
| Keywords: | dispersion problem
polynomial time algorithm |
| Issue Date: | 2018-03-21 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 10823 |
| Start page: | 263 |
| End page: | 272 |
| DOI: | 10.1007/978-3-319-78455-7_20 |
| Abstract: | Given a set P of n elements, and a function d that assigns a non-negative real number d(p, q) for each pair of elements p,q∈P, we want to find a subset S⊆P with |S|=k such that cost(S)=min{d(p,q)∣p,q∈S} is maximized. This is the max-min k-dispersion problem. In this paper, exact algorithms for the max-min k-dispersion problem are studied. We first show the max-min k-dispersion problem can be solved in O(n^<ωk>/^3logn) time. Then, we show two special cases in which we can solve the problem quickly. |
| Rights: | This is the author-created version of Springer, Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno and Kunihiro Wasa, Lecture Notes in Computer Science, 10823, 2018, 263-272. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-78455-7_20 |
| URI: | http://hdl.handle.net/10119/15857 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 24081.pdf | | 127Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
