Approximation algorithm for the balanced 2-connected k-partition problem

For two positive integers m,k and a connected graph G=(V,E) with a nonnegative vertex weight function w, the balanced m-connected k-partition problem, denoted as BCmPk, is to find a partition of V into k disjoint nonempty vertex subsets (V1,V2,…,Vk) such that each G[Vi] (the subgraph of G induced by...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 609; pp. 627 - 638
Main Authors:	Wu, Di, Zhang, Zhao, Wu, Weili
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.01.2016
Subjects:	Algorithms Approximation Balanced m-connected k-partition Balancing FPTAS Graphs Interval graph Intervals Lower bounds Mathematical analysis Pseudo-polynomial time algorithm Weight reduction Interval graph Balanced m-connected k-partition FPTAS Pseudo-polynomial time algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!