Strongly 2-shape-sortability of vector partitions

Huilan Chang, Jun-Yi Guo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume11
Issue number4
DOIs
Publication statusPublished - 2006 Jun 1

Fingerprint

Cones
Partition
Partitioning
Disjoint
Cone

Keywords

  • Optimality
  • Sortability
  • Vector partition

ASJC Scopus subject areas

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

Cite this

Strongly 2-shape-sortability of vector partitions. / Chang, Huilan; Guo, Jun-Yi.

In: Journal of Combinatorial Optimization, Vol. 11, No. 4, 01.06.2006, p. 407-410.

Research output: Contribution to journalArticle

@article{af71f440ccda4a34b513fb004d897607,
title = "Strongly 2-shape-sortability of vector partitions",
abstract = "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.",
keywords = "Optimality, Sortability, Vector partition",
author = "Huilan Chang and Jun-Yi Guo",
year = "2006",
month = "6",
day = "1",
doi = "10.1007/s10878-006-8209-3",
language = "English",
volume = "11",
pages = "407--410",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - Strongly 2-shape-sortability of vector partitions

AU - Chang, Huilan

AU - Guo, Jun-Yi

PY - 2006/6/1

Y1 - 2006/6/1

N2 - 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.

AB - 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.

KW - Optimality

KW - Sortability

KW - Vector partition

UR - http://www.scopus.com/inward/record.url?scp=33744522309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744522309&partnerID=8YFLogxK

U2 - 10.1007/s10878-006-8209-3

DO - 10.1007/s10878-006-8209-3

M3 - Article

AN - SCOPUS:33744522309

VL - 11

SP - 407

EP - 410

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 4

ER -