Approximating the Maximally Balanced Connected Partition Problem in graphs
From MaRDI portal
(Redirected from Publication:673224)
Recommendations
- Approximation algorithms for maximally balanced connected graph partition
- Approximation and inaproximability results on balanced connected partitions of graphs
- Approximation algorithms for maximally balanced connected graph partition
- On finding connected balanced partitions of trees
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
Cites work
Cited in
(42)- An overview of graph covering and partitioning
- Balanced connected graph partition
- Most balanced minimum cuts
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
- Reconfiguration of connected graph partitions via recombination
- scientific article; zbMATH DE number 2230227 (Why is no real title available?)
- Complexity and inapproximability results for balanced connected subgraph problem
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- Structural and algorithmic properties of 2-community structures
- Cardinality constrained connected balanced partitions of trees under different criteria
- Uniform and most uniform partitions of trees
- Bisecting a 4-connected graph with three resource sets
- BALANCED PARTITION OF MINIMUM SPANNING TREES
- New insight into 2-community structures in graphs with applications in social networks
- Reconfiguration of connected graph partitions
- On finding connected balanced partitions of trees
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- Approximation and inaproximability results on balanced connected partitions of graphs
- Quasi-Monte Carlo Methods for Binary Event Models with Complex Family Data
- Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs
- A 7/6-approximation algorithm for the max-min connected bipartition problem on grid graphs
- Approximation algorithm for the balanced 2-connected k-partition problem
- Graphs without a partition into two proportionally dense subgraphs
- Approximation algorithms for maximization problems arising in graph partitioning
- Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
- On the parameterized complexity of computing balanced partitions in graphs
- Reconfiguration of connected graph partitions via recombination
- Approximation algorithms for the maximally balanced connected graph tripartition problem
- Approximation algorithms for maximally balanced connected graph partition
- Approximation algorithms for maximally balanced connected graph partition
- Balanced connected partitioning of unweighted grid graphs
- Approximation algorithms for the maximum bounded connected bipartition problem
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- Approximation and parameterized algorithms for balanced connected partition problems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
- Max-min weight balanced connected partition
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
- Metaheuristics for the minimum gap graph partitioning problem
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
This page was built for publication: Approximating the Maximally Balanced Connected Partition Problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673224)
