Abstract
In this paper, the weighted tailored 2-partition problem and the weighted 2-center problem under l∞-distance are considered. An O(2d-1·d·n) algorithm to solve the weighted tailored 2-partition problem and an O(d2·n + d2·log*d) time algorithm to solve the weighted 2-center problem in the d-dimensional case are presented.
Original language | English |
---|---|
Pages (from-to) | 397-410 |
Number of pages | 14 |
Journal | Discrete Applied Mathematics |
Volume | 40 |
Issue number | 3 |
DOIs | |
State | Published - 14 Dec 1992 |