Approximation algorithm for the balanced 2-connected k-partition problem
DOI10.1016/J.TCS.2015.02.001zbMATH Open1333.68298OpenAlexW2063081927MaRDI QIDQ896161FDOQ896161
Authors: Di Wu, Zhao Zhang, Weili Wu 
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.001
Recommendations
- Approximation algorithm for the balanced 2-connected bipartition problem
- Approximation and parameterized algorithms for balanced connected partition problems
- Approximation algorithms for maximally balanced connected graph partition
- Approximation algorithms for maximally balanced connected graph partition
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Improved approximation algorithms for balanced partitioning problems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Algorithms for the Balanced Edge Partitioning Problem
- Approximation algorithms for the maximum bounded connected bipartition problem
- Approximation algorithms for the maximally balanced connected graph tripartition problem
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- On the approximability of some Maximum Spanning Tree Problems
- Graph theory with applications
- Most uniform path partitioning and its use in image processing
- Approximation and inaproximability results on balanced connected partitions of graphs
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- On the complexity of partitioning graphs into connected subgraphs
- Title not available (Why is that?)
- A homology theory for spanning tress of a graph
- Clustering on trees
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- Approximation algorithm for the balanced 2-connected bipartition problem
Cited In (12)
- Reconfiguration of connected graph partitions via recombination
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment
- Doubly balanced connected graph partitioning
- Cut and flow formulations for the balanced connected \(k\)-partition problem
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- Approximation algorithm for the balanced 2-connected bipartition problem
- Reconfiguration of connected graph partitions via recombination
- Approximation algorithms for maximally balanced connected graph partition
- Approximation and parameterized algorithms for balanced connected partition problems
- Approximation algorithms for the maximum bounded connected bipartition problem
- Max-min weight balanced connected partition
This page was built for publication: Approximation algorithm for the balanced 2-connected \(k\)-partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896161)
