Paper Abstract and Keywords |
Presentation |
2018-09-18 11:05
Max-Min Dispersion on a Line Tetsuya Araki (Tokyo Metropolitan Univ), Shin-ichi Nakano (Gunma Univ) COMP2018-11 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Given a set P of n locations on which facilities can be placed and an integer k, we want to place k facilities on some locations so that a designated objective function is maximized. The problem is called the k-dispersion problem. In this paper we give a simple O(n) time algorithm to solve the max-min version of the k-dispersion problem if P is a set of points on a line. This is the first O(n) time algorithm to solve the max-min k-dispersion problem for the set of “unsorted” points on a line. If P is a set of sorted points on a line, and the input is given as an array in which the coordinates of the points are stored in the sorted order, then by slightly modifying the algorithm above one can solve the dispersion problem in O(log n) time. This is the first sublinear time algorithm to solve the max-min k-dispersion problem for the set of sorted points on a line. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
dispersion problem / algorithm / / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 118, no. 216, COMP2018-11, pp. 17-21, Sept. 2018. |
Paper # |
COMP2018-11 |
Date of Issue |
2018-09-11 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2018-11 |
Conference Information |
Committee |
COMP |
Conference Date |
2018-09-18 - 2018-09-18 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Kyusyu Institute of Technology |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2018-09-COMP |
Language |
English (Japanese title is available) |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Max-Min Dispersion on a Line |
Sub Title (in English) |
|
Keyword(1) |
dispersion problem |
Keyword(2) |
algorithm |
Keyword(3) |
|
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Tetsuya Araki |
1st Author's Affiliation |
Tokyo Metropolitan University (Tokyo Metropolitan Univ) |
2nd Author's Name |
Shin-ichi Nakano |
2nd Author's Affiliation |
Guinma University (Gunma Univ) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-2 |
Date Time |
2018-09-18 11:05:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2018-11 |
Volume (vol) |
vol.118 |
Number (no) |
no.216 |
Page |
pp.17-21 |
#Pages |
5 |
Date of Issue |
2018-09-11 (COMP) |
|