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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 57; no. 4; pp. 1263 - 1275
Main Authors:	Wang, Lele, Zhang, Zhao, Wu, Di, Wu, Weili, Fan, Lidan
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.12.2013 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!