BibTeX
CSL-JSON
MLA
Harvard
A Note on Minimum-Sum Coverage by Aligned Disks
release_r27hjtijonhhfjxceecevayqky
by
Chan-Su Shin
Released
as a article
.
2012
Abstract
In this paper, we consider a facility location problem to find a minimum-sum
coverage of n points by disks centered at a fixed line. The cost of a disk with
radius r has a form of a non-decreasing function f(r) = r^a for any a >= 1. The
goal is to find a set of disks under Lp metric such that the disks are centered
on the x-axis, their union covers n points, and the sum of the cost of the
disks is minimized. Alt et al. [1] presented an algorithm in O(n^4 log n) time
for any a > 1 under any Lp metric. We present a faster algorithm for this
problem in O(n^2 log n) time for any a > 1 and any Lp metric.
In text/plain
format
Archived Files and Locations
application/pdf 116.9 kB
file_3x35n2hj5rd6xc3nx6uwuwyxkm
|
arxiv.org (repository) web.archive.org (webarchive) |
application/pdf 111.0 kB
file_u764avdlbvd5zoxfoe7tx6tsam
|
archive.org (archive) |
Read Archived PDF
Preserved and Accessible
arXiv
1202.4821v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links