Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract)

DOI10.1137/1.9781611973730.46zbMath1371.68207arXiv1410.5105OpenAlexW4251124774MaRDI QIDQ5363092

Chaitanya Swamy, Guru Prashanth Guruganesh, Laura Sanità

Publication date: 5 October 2017

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Vertex downgrading to minimize connectivity

This page was built for publication: Improved Region-Growing and Combinatorial Algorithms for k-Route Cut Problems (Extended Abstract)