Max-min weight balanced connected partition

For a connected graph and a positive integral vertex weight function , a max-min weight balanced connected -partition of , denoted as , is a partition of into disjoint vertex subsets such that each (the subgraph of induced by ) is connected, and is maximum. Such a problem has a lot of applications i...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 57; H. 4; S. 1263 - 1275
Hauptverfasser:	Wang, Lele, Zhang, Zhao, Wu, Di, Wu, Weili, Fan, Lidan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Boston Springer US 01.12.2013 Springer Springer Nature B.V
Schlagworte:	Algorithms Analysis Approximation Balancing Computer Science Graphs Image processing Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Real Functions Studies FPTAS Balanced connected partition Pseudo-polynomial time algorithm
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!