Approximating the Maximally Balanced Connected Partition Problem in graphs
From MaRDI portal
Publication:673224
DOI10.1016/S0020-0190(96)00175-5zbMath0900.68261MaRDI QIDQ673224
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem, Balanced connected graph partition, Structural and algorithmic properties of 2-community structures, FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS, An overview of graph covering and partitioning, Approximation algorithms for the maximum bounded connected bipartition problem, New Insight into 2-Community Structures in Graphs with Applications in Social Networks, Metaheuristics for the minimum gap graph partitioning problem, Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs, Max-min weight balanced connected partition, Reconfiguration of connected graph partitions, Approximation and parameterized algorithms for balanced connected partition problems, Approximation algorithm for the balanced 2-connected \(k\)-partition problem, 3D geo-graphs: efficient flip verification for the spherical zoning problem, Balanced connected partitions of graphs: approximation, parameterization and lower bounds, Quasi-Monte Carlo Methods for Binary Event Models with Complex Family Data, Unnamed Item, A linear-time algorithm for finding an edge-partition with max-min ratio at most two, Uniform and most uniform partitions of trees, Graphs without a partition into two proportionally dense subgraphs, Partitioning a graph into balanced connected classes: formulations, separation and experiments, Bisecting a 4-connected graph with three resource sets, Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning, Approximation algorithms for maximally balanced connected graph partition, Reconfiguration of connected graph partitions via recombination, Reconfiguration of connected graph partitions via recombination, Unnamed Item, Approximation algorithms for the maximally balanced connected graph tripartition problem, Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
Cites Work
