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

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The partition problem concerns the partitioning of n given vectors in d-space into p parts, so as to maximize an objective function which is convex on the sum of vectors in each part. The problem has applications in diverse fields that include clustering, inventory, scheduling and statistical hypothesis testing. Since the objective function is convex, the partition problem can be reduced to the problem of maximizing the same objective over the partition polytope, defined to be the convex hull of all solutions. In this article we completely characterize the vertices of partition polytopes when either d=2 or p=2, and determine the maximum number of vertices of any partition polytope of n vectors when d=2 or p=2 up to a constant factor. Our characterization implies a bijection between vertices of the polytope of 0-separable partitions, and is best possible in the sense that there are examples in the literature showing the analogue fails already for p=d=3. Our enumerative results provide lower bounds on the time complexity needed to solve the partition problem when the objective function is presented by an oracle.

Original languageEnglish (US)
Pages (from-to)1-15
Number of pages15
JournalDiscrete Applied Mathematics
Volume124
Issue number1-3
DOIs
StatePublished - Dec 15 2002

Fingerprint

Polytopes
Point Sets
Partition
Vertex of a graph
Polytope
Objective function
Scheduling
Testing
D-space
Hypothesis Testing
Bijection
Convex Hull
Time Complexity
Partitioning
Maximise
Clustering
Lower bound
Analogue
Imply

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Vertex characterization of partition polytopes of bipartitions and of planar point sets. / Aviran, Sharon; Lev-Tov, Nissan; Onn, Shmuel; Rothblum, Uriel G.

In: Discrete Applied Mathematics, Vol. 124, No. 1-3, 15.12.2002, p. 1-15.

Research output: Contribution to journalArticle

Aviran, Sharon ; Lev-Tov, Nissan ; Onn, Shmuel ; Rothblum, Uriel G. / Vertex characterization of partition polytopes of bipartitions and of planar point sets. In: Discrete Applied Mathematics. 2002 ; Vol. 124, No. 1-3. pp. 1-15.
@article{d186c6118e714606aa40d1662bb047bb,
title = "Vertex characterization of partition polytopes of bipartitions and of planar point sets",
abstract = "The partition problem concerns the partitioning of n given vectors in d-space into p parts, so as to maximize an objective function which is convex on the sum of vectors in each part. The problem has applications in diverse fields that include clustering, inventory, scheduling and statistical hypothesis testing. Since the objective function is convex, the partition problem can be reduced to the problem of maximizing the same objective over the partition polytope, defined to be the convex hull of all solutions. In this article we completely characterize the vertices of partition polytopes when either d=2 or p=2, and determine the maximum number of vertices of any partition polytope of n vectors when d=2 or p=2 up to a constant factor. Our characterization implies a bijection between vertices of the polytope of 0-separable partitions, and is best possible in the sense that there are examples in the literature showing the analogue fails already for p=d=3. Our enumerative results provide lower bounds on the time complexity needed to solve the partition problem when the objective function is presented by an oracle.",
author = "Sharon Aviran and Nissan Lev-Tov and Shmuel Onn and Rothblum, {Uriel G.}",
year = "2002",
month = "12",
day = "15",
doi = "10.1016/S0166-218X(01)00326-2",
language = "English (US)",
volume = "124",
pages = "1--15",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

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

AU - Aviran, Sharon

AU - Lev-Tov, Nissan

AU - Onn, Shmuel

AU - Rothblum, Uriel G.

PY - 2002/12/15

Y1 - 2002/12/15

N2 - The partition problem concerns the partitioning of n given vectors in d-space into p parts, so as to maximize an objective function which is convex on the sum of vectors in each part. The problem has applications in diverse fields that include clustering, inventory, scheduling and statistical hypothesis testing. Since the objective function is convex, the partition problem can be reduced to the problem of maximizing the same objective over the partition polytope, defined to be the convex hull of all solutions. In this article we completely characterize the vertices of partition polytopes when either d=2 or p=2, and determine the maximum number of vertices of any partition polytope of n vectors when d=2 or p=2 up to a constant factor. Our characterization implies a bijection between vertices of the polytope of 0-separable partitions, and is best possible in the sense that there are examples in the literature showing the analogue fails already for p=d=3. Our enumerative results provide lower bounds on the time complexity needed to solve the partition problem when the objective function is presented by an oracle.

AB - The partition problem concerns the partitioning of n given vectors in d-space into p parts, so as to maximize an objective function which is convex on the sum of vectors in each part. The problem has applications in diverse fields that include clustering, inventory, scheduling and statistical hypothesis testing. Since the objective function is convex, the partition problem can be reduced to the problem of maximizing the same objective over the partition polytope, defined to be the convex hull of all solutions. In this article we completely characterize the vertices of partition polytopes when either d=2 or p=2, and determine the maximum number of vertices of any partition polytope of n vectors when d=2 or p=2 up to a constant factor. Our characterization implies a bijection between vertices of the polytope of 0-separable partitions, and is best possible in the sense that there are examples in the literature showing the analogue fails already for p=d=3. Our enumerative results provide lower bounds on the time complexity needed to solve the partition problem when the objective function is presented by an oracle.

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

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

U2 - 10.1016/S0166-218X(01)00326-2

DO - 10.1016/S0166-218X(01)00326-2

M3 - Article

AN - SCOPUS:84867955940

VL - 124

SP - 1

EP - 15

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-3

ER -