Title of article
Finding anEuclideananti-k-centrum locationofasetofpoints
Author/Authors
Antonio J.Lozano، نويسنده , , JuanA.Mesab، نويسنده , , FrankPlastria، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
10
From page
292
To page
301
Abstract
An obnoxiousfacilityistobelocatedinsideapolygonalregionoftheplane,maximizingthesumofthe
k smallest weightedEuclideandistancesto n given points,eachprotectedbysomepolygonalforbidden
region. Fortheunweightedcaseand k fixed an O(n2 log n) timealgorithmispresented.Fortheweighted
case athoroughstudyoftherelevantstructureofthemultiplicativelyweightedorder-k-Voronoi diagram
leads tothedesignofan O(kn3 + n3 log n) timealgorithmforfindinganoptimalsolutiontotheanti-
t-centrum problemforevery t = 1,..., k, simultaneously.
Keywords
Continuous location , Euclidean distance , Anti-kk-centrum , Obnoxious facility
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927645
Link To Document