Approximation and parameterized algorithms for balanced connected partition problems

DOI10.1007/978-3-030-95018-7_17MaRDI QIDQ6102278

Yoshiko Wakabayashi, Phablo F. S. Moura, Matheus Jun Ota

Publication date: 8 May 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmparameterized algorithmbalanced connected partition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

An overview of graph covering and partitioning ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• On the complexity of partitioning graphs into connected subgraphs
• Clustering on trees
• Most uniform path partitioning and its use in image processing
• Partitioning a graph into balanced connected classes: formulations, separation and experiments
• Approximation algorithms for the maximally balanced connected graph tripartition problem
• FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
• Graph Layout Problems Parameterized by Vertex Cover
• Shifting algorithms for tree partitioning with general weighting functions
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• A homology theory for spanning tress of a graph
• Max-min partitioning of grid graphs into connected components
• Approximation algorithms for maximally balanced connected graph partition
• A polynomial-time algorithm for max-min partitioning of ladders

This page was built for publication: Approximation and parameterized algorithms for balanced connected partition problems