Vertex characterization of partition polytopes of bipartitions and of planar point sets

DOI10.1016/S0166-218X(01)00326-2zbMath1011.52006MaRDI QIDQ1850111

Nissan Lev-Tov, Uriel G. Rothblum, Sharon Aviran, Shmuel Onn

Publication date: 2 December 2002

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

zbMATH Keywords

time complexitypartition problempartition polytopevertex characterization

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Nonnumerical algorithms (68W05)

Related Items (3)

Counting disjoint 2-partitions for points in the plane ⋮ Sphere-separable partitions of multi-parameter elements ⋮ Good Clusterings Have Large Volume

Cites Work

• Optimal partitions having disjoint convex and conic hulls
• Separable partitions
• Linear-shaped partition problems
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• Optimality of Monotone Assemblies for Coherent Systems Composed of Series Modules
• A Polynomial Time Algorithm for Shaped Partition Problems
• The number of partitions of a set of N points in k dimensions induced by hyperplanes
• Cutting corners

This page was built for publication: Vertex characterization of partition polytopes of bipartitions and of planar point sets