A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs
From MaRDI portal
Publication:3098085
DOI10.1007/978-3-642-24983-9_19zbMath1349.68323OpenAlexW28899810MaRDI QIDQ3098085
Publication date: 11 November 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24983-9_19
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Approximation algorithms for the maximum bounded connected bipartition problem ⋮ Approximation algorithms for maximally balanced connected graph partition ⋮ 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: A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs