Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs

DOI10.1137/1.9781611975482.65zbMath1431.68146arXiv1811.04052OpenAlexW2900306427MaRDI QIDQ5236249

Alireza Farhadi, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.04052

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items

Computing connected-\(k\)-subgraph cover with connectivity requirement