Are there more almost separable partitions than separable partitions?

DOI10.1007/S10878-012-9536-1zbMATH Open1296.90101OpenAlexW2013793279MaRDI QIDQ2015797FDOQ2015797

Authors Fei-Huang Chang, Hongbin Chen, Frank K. Hwang

Publication date 24 June 2014

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9536-1

zbMATH Keywords

partitionseparable partitionoptimal partitionalmost separable partition

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Separable partitions
• Vertex characterization of partition polytopes of bipartitions and of planar point sets
• On the number of separable partitions
• Optimal separable partitioning in the plane
• scientific article; zbMATH DE number 6850368

Cites work

• A Polynomial Time Algorithm for Shaped Partition Problems
• On the number of separable partitions
• Optimal Set Partitioning
• Optimal partitions having disjoint convex and conic hulls
• Separable partitions
• The number of partitions of a set of N points in k dimensions induced by hyperplanes

Cited in

(1)

• On the number of separable partitions

This page was built for publication: Are there more almost separable partitions than separable partitions?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015797)