A fast algorithm for computing steiner edge connectivity

DOI10.1145/780542.780568MaRDI QIDQ3581294zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 16 August 2010

Published in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL http://eprints.iisc.ac.in/261/1/p167-cole.pdf

Mathematics Subject Classification ID

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

Recommendations

• An approximation algorithm for the Steiner connectivity problem
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner tree problem in graphs
• scientific article; zbMATH DE number 169458
• scientific article; zbMATH DE number 4063109
• A Faster Algorithm for the Steiner Tree Problem
• Faster exact algorithms for steiner trees in planar networks
• A robust and scalable algorithm for the Steiner problem in graphs
• Faster Steiner Tree Computation in Polynomial-Space

Cited in

(3)

• Fast exact algorithms for survivable network design with uniform requirements
• Deterministic minimum cut in poly-logarithmic maximum flows
• Optimal sensitivity oracle for Steiner mincut

This page was built for publication: A fast algorithm for computing steiner edge connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581294)