Improved bounds and algorithms for graph cuts and network reliability

DOI10.1137/1.9781611973402.19zbMath1421.68134arXiv1602.08730OpenAlexW2289417990MaRDI QIDQ5383978

Aravind Srinivasan, David G. Harris

Publication date: 20 June 2019

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

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

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 (2)

Unnamed Item ⋮ A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

This page was built for publication: Improved bounds and algorithms for graph cuts and network reliability