Optimal separable partitioning in the plane

Michal Benelli, Refael Hassin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

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)}.

Original languageEnglish
Pages (from-to)215-224
Number of pages10
JournalDiscrete Applied Mathematics
Volume59
Issue number3
DOIs
StatePublished - 26 May 1995

Fingerprint

Dive into the research topics of 'Optimal separable partitioning in the plane'. Together they form a unique fingerprint.

Cite this