Presentation 2018-10-26
An Approximation Algorithm for the 2-Dispersion Problem
Kazuyuki Amano, Shin-ichi Nakano,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Let $P$ be a set of points on the plane, and $d(p,q)$ be the distance between a pair of points $p,q$ in $P$. For a point $pin P$ and a subset $Ssubset P$ with $|S |ge 3$, the $2$-dispersion cost, denoted by $cost_2(p,S)$, of $p$ with respect to $S$is the sum of(1) the distance from $p$ to the nearest point in $S setminus{ p }$and(2) the distance from $p$ to the second nearest point in $S setminus{ p }$. The $2$-dispersion cost $cost_2(S)$ of $Ssubset P$ with $|S|ge 3$is $min_{pin S}{ cost_2(p,S) }$. Given a set $P$ of $n$ points and an integer $k$we wish to compute $k$ point subset $S$ of $P$with maximum $cost_2(S)$. In this paper we give a simple $1/({4sqrt{3}})$ approximation algorithmfor the problem.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) dispersion problemalgorithm
Paper # COMP2018-26
Date of Issue 2018-10-19 (COMP)

Conference Information
Committee COMP
Conference Date 2018/10/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Kyoto University
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Toshihiro Fujito(Toyohashi Univ. of Tech.)
Vice Chair Shinichi Nakano(Gunma Univ.)
Secretary Shinichi Nakano(Kyoto Univ.)
Assistant Kazuhisa Seto(Seikei Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG-JTITLE
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Approximation Algorithm for the 2-Dispersion Problem
Sub Title (in English)
Keyword(1) dispersion problemalgorithm
1st Author's Name Kazuyuki Amano
1st Author's Affiliation Gunma University(Gunma Univ.)
2nd Author's Name Shin-ichi Nakano
2nd Author's Affiliation Gunma University(Gunma Univ.)
Date 2018-10-26
Paper # COMP2018-26
Volume (vol) vol.118
Number (no) COMP-268
Page pp.pp.41-43(COMP),
#Pages 3
Date of Issue 2018-10-19 (COMP)