scientific article; zbMATH DE number 6472583

MaRDI QIDQ5501786zbMATH OpenFDO

Authors Guy Kortsarz, David Peleg

Publication date 14 August 2015

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cited in

(9)

• Approximating the weight of shallow Steiner trees
• Generalized submodular cover problems and applications
• The maximum \(f\)-depth spanning tree problem
• Brief announcement: Characterizing demand graphs for (fixed-parameter) shallow-light Steiner network
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
• Approximation Algorithms for Key Management in Secure Multicast
• On Hop-Constrained Steiner Trees in Tree-Like Metrics
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
• Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing

This page was built for publication:

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