Optimal cuts and partitions in tree metrics in polynomial time

We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one-dimensional geometric metric settings. Our method of solution could...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 113; H. 12; S. 447 - 451
Hauptverfasser: Karpinski, Marek, Lingas, Andrzej, Sledneu, Dzmitry
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 30.06.2013
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Computational complexity
Computer and Information Sciences
Computer science
Computer Sciences
Data processing
Data- och informationsvetenskap (Datateknik)
Datavetenskap (Datalogi)
Dynamic programming
Geometric metric
Geometry
Graph theory
Graphs
Matematik
Mathematical Sciences
Natural Sciences
Naturvetenskap
Optimal bisection
Optimal cut
Optimization
Partitions
Polynomial time
Polynomials
Shortest path algorithms
Shortest-path problems
Studies
Tree metric
Trees
Optimal bisection
Tree metric
Optimal cut
Computational complexity
Geometric metric
Polynomial time
ISSN:0020-0190, 1872-6119
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one-dimensional geometric metric settings. Our method of solution could be also of independent interest in other applications. We discuss also an extension of our method to the class of metrics induced by the bounded treewidth graphs. •A novel polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree.•A resolution of the exact complexity status of the optimal partition problems in one-dimensional geometric metric settings.•A discussion of an extension of our method to the class of metrics induced by the bounded treewidth graphs.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2013.03.009