Approximation Algorithm for the Balanced 2-Connected Bipartition Problem

DOI10.1007/978-3-319-08783-2_38zbMath1332.68288OpenAlexW201870825MaRDI QIDQ2920480

Zhao Zhang, Di Wu, Weili Wu, Xiao-hui Huang

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_38

zbMATH Keywords

interval graphFPTASpseudo-polynomial time algorithmbalanced \(m\)-connected \(k\)-partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Approximation algorithm for the balanced 2-connected \(k\)-partition problem

This page was built for publication: Approximation Algorithm for the Balanced 2-Connected Bipartition Problem