Optimal separable partitioning in the plane

Optimal separable partitioning in the plane

0.00 Avg rating0 Votes
Article ID: iaor19971041
Country: Netherlands
Volume: 59
Issue: 3
Start Page Number: 215
End Page Number: 224
Publication Date: May 1995
Journal: Discrete Applied Mathematics
Authors: ,
Keywords: sets
Abstract:

Sets of points are called a separable if their convex hulls are disjoint. The authors suggest a technique for optimally partitioning of a set N into two separable subsets, N1, N2. They assume that a monotone measure, μ, is defined over the subsets of N, and the objective is to minimize max{μ(N1),μ(N2)}.

Reviews

Required fields are marked *. Your email address will not be published.