Optimal separable partitioning in the plane
type: Item
instance of: scholarly article
title: Optimal separable partitioning in the plane
zbMATH Open document ID: 0829.90084
DOI: 10.1016/0166-218X(93)E0173-V
author: Michal Benelli
author: Refael Hassin
published in: Discrete Applied Mathematics
publication date: 1995-07-03T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 769293
zbMATH Keywords: optimal separable partitioning
zbMATH Keywords: separable subsets
MaRDI profile type: Publication
cites work: Q3138982
cites work: Optimal partitions having disjoint convex and conic hulls
cites work: Q4765877
cites work: On clustering problems with connected optima in Euclidean spaces
cites work: Q4181272
cites work: Geometric clusterings
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: Dynamic Three-Dimensional Linear Programming
cites work: Q3328583
cites work: Efficient algorithms for interval graphs and circular-arc graphs
cites work: Minimum Cuts for Circular-Arc Graphs
cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Set partition by globally optimized cluster seed points
full work available at URL: 0166-218x(93)e0173-v
OpenAlex ID: W2082133498
description: scientific article; zbMATH DE number 769293