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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 57; číslo 4; s. 1263 - 1275
Hlavní autori:	Wang, Lele, Zhang, Zhao, Wu, Di, Wu, Weili, Fan, Lidan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.12.2013 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!