Strongly 2-shape-sortability of vector partitions

Huilan Chang, Junyi Guo*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Partitioning points optimally in ℝ1 have been well studied. Hwang et al. (2003) first extended the optimal partitioning problems from ℝ1 to ℝd . In particular, they studied the "sortability" of some partition properties. They also constructed examples to show that some partition properties, like Disjoint and Cone disjoint, are not sortable under some constraints S. In this note we construct a more concise example than theirs and also prove that another partition property, Nonpenetrating, is not sortable under S.

Original languageEnglish
Pages (from-to)407-410
Number of pages4
JournalJournal of Combinatorial Optimization
Issue number4
Publication statusPublished - 2006 Jun
Externally publishedYes


  • Optimality
  • Sortability
  • Vector partition

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Strongly 2-shape-sortability of vector partitions'. Together they form a unique fingerprint.

Cite this