scientific article; zbMATH DE number 5279390
From MaRDI portal
Publication:5387695
zbMath1152.68443MaRDI QIDQ5387695
Frédéric Chataigner, Liliane R. B. Salgado, Yoshiko Wakabayashi
Publication date: 27 May 2008
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85/showToc.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (18)
A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem ⋮ Balanced connected graph partition ⋮ An overview of graph covering and partitioning ⋮ Approximation algorithms for the maximum bounded connected bipartition problem ⋮ An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs ⋮ Max-min weight balanced connected partition ⋮ Approximation and parameterized algorithms for balanced connected partition problems ⋮ Approximation algorithm for the balanced 2-connected \(k\)-partition problem ⋮ Cardinality constrained connected balanced partitions of trees under different criteria ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximation algorithms for maximally balanced connected graph partition ⋮ Reconfiguration of connected graph partitions via recombination ⋮ On the complexity of isoperimetric problems on trees ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
This page was built for publication:
