| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143464 | Operations Research Letters | 2006 | 9 Pages |
Abstract
Given are a finite set of points P and a compact polygonal set S in R2R2. The problem is to locate two new facilities in S, maximizing the minimum of all weighted distances between the points in P and the two new facilities, and the distance between the pair of new facilities. We present subquadratic algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Arie Tamir,