Max-min weight balanced connected partition
From MaRDI portal
Publication:386475
DOI10.1007/S10898-012-0028-8zbMATH Open1282.90222OpenAlexW2094004331MaRDI QIDQ386475FDOQ386475
Authors: Lele Wang, Zhao Zhang, Weili Wu, Lidan Fan, Di Wu 
Publication date: 9 December 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0028-8
Recommendations
- Approximation and inaproximability results on balanced connected partitions of graphs
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem
- Approximation algorithm for the balanced 2-connected bipartition problem
- Approximation algorithms for the maximally balanced connected graph tripartition problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Graph theory
- On the approximability of some Maximum Spanning Tree Problems
- 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
- Uncontractable 4-connected graphs
- On the complexity of partitioning graphs into connected subgraphs
- Trapezoid graphs and their coloring
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
- A linear-time algorithm for four-partitioning four-connected planar graphs
- A homology theory for spanning tress of a graph
- A linear algorithm for bipartition of biconnected graphs
- Title not available (Why is that?)
- Clustering on trees
- On the structure of trapezoid graphs
- An efficient algorithm to solve connectivity problem on trapezoid graphs
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
- Max-Min Tree Partitioning
- Nonseparating cycles inK-Connected graphs
- Max-min partitioning of grid graphs into connected components
- A polynomial-time algorithm for max-min partitioning of ladders
Cited In (6)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Cut and flow formulations for the balanced connected \(k\)-partition problem
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- Approximation algorithms for maximally balanced connected graph partition
- Approximation algorithms for the maximally balanced connected graph tripartition problem
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
This page was built for publication: Max-min weight balanced connected partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386475)
