Approximation algorithms for the maximally balanced connected graph tripartition problem

Given a vertex-weighted connected graph G = ( V , E , w ( · ) ) , the maximally balanced connected graph k - partition ( k - BGP ) seeks to partition the vertex set V into k non-empty parts such that the subgraph induced by each part is connected and the weights of these k parts are as balanced as p...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2022-10, Vol.44 (3), p.1753-1773
Hauptverfasser:	Chen, Guangting, Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Liu, Tian, Zhang, An
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Combinatorics Convex and Discrete Geometry Graph theory Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!