Improved approximating algorithms for directed Steiner forest

MaRDI QIDQ4633905zbMATH OpenFDO

Authors Moran Feldman, Guy Kortsarz, Zeev Nutov

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496870

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Improved approximation algorithms for directed Steiner forest
• scientific article; zbMATH DE number 1303557
• Approximation Algorithms for Directed Steiner Problems
• Approximation algorithms for spanner problems and directed Steiner forest
• scientific article; zbMATH DE number 2119644

Cited in

(6)

• How to Secure Matchings Against Edge Failures
• Improved approximation algorithms for directed Steiner forest
• Approximating some network design problems with node costs
• Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
• Navigational guidance -- a deep learning approach

This page was built for publication: Improved approximating algorithms for directed Steiner forest

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