scientific article; zbMATH DE number 6472583

zbMath1321.05270MaRDI QIDQ5501786

David Peleg, Guy Kortsarz

Publication date: 14 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (8)

Approximation Algorithms for Key Management in Secure Multicast ⋮ Unnamed Item ⋮ Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs ⋮ Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ Approximating the weight of shallow Steiner trees ⋮ Generalized submodular cover problems and applications ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics ⋮ The maximum \(f\)-depth spanning tree problem

This page was built for publication: