TY - JOUR
T1 - Optimal separable partitioning in the plane
AU - Benelli, Michal
AU - Hassin, Refael
PY - 1995/5/26
Y1 - 1995/5/26
N2 - Sets of points are called separable if their convex hulls are disjoint. We suggest a technique for optimally partitioning of a set N into two separable subsets, N1, N2. We assume that a monotone measure, μ, is defined over the subsets of N, and the objective is to minimize max{μ(N1),μ(N2)}.
AB - Sets of points are called separable if their convex hulls are disjoint. We suggest a technique for optimally partitioning of a set N into two separable subsets, N1, N2. We assume that a monotone measure, μ, is defined over the subsets of N, and the objective is to minimize max{μ(N1),μ(N2)}.
UR - http://www.scopus.com/inward/record.url?scp=0002496574&partnerID=8YFLogxK
U2 - 10.1016/0166-218X(95)80002-L
DO - 10.1016/0166-218X(95)80002-L
M3 - מאמר
AN - SCOPUS:0002496574
VL - 59
SP - 215
EP - 224
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
SN - 0166-218X
IS - 3
ER -