Optimal separable partitioning in the plane

DOI10.1016/0166-218X(93)E0173-VzbMath0829.90084OpenAlexW2082133498MaRDI QIDQ1893156

Michal Benelli, Refael Hassin

Publication date: 3 July 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0173-v

zbMATH Keywords

separable subsetsoptimal separable partitioning

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set partition by globally optimized cluster seed points
• On clustering problems with connected optima in Euclidean spaces
• Optimal partitions having disjoint convex and conic hulls
• Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
• Geometric clusterings
• Minimum Cuts for Circular-Arc Graphs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Constructing Arrangements of Lines and Hyperplanes with Applications
• An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
• Efficient algorithms for interval graphs and circular-arc graphs
• Dynamic Three-Dimensional Linear Programming

This page was built for publication: Optimal separable partitioning in the plane