scientific article
From MaRDI portal
Publication:3140426
zbMath0801.68134MaRDI QIDQ3140426
Neal E. Young, Balaji Raghavachari, Samir Khuller
Publication date: 2 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
Euclidean Steiner Spanners: Light and Sparse ⋮ Shortest shortest path trees of a network ⋮ An improved approximation scheme for the Group Steiner Problem ⋮ Compact location problems with budget and communication constraints ⋮ The multi-weighted spanning tree problem ⋮ Steiner trees with bounded RC-delay ⋮ Low-light trees, and tight lower bounds for Euclidean spanners ⋮ On notions of distortion and an almost minimum spanning tree with constant average distortion ⋮ Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones ⋮ Bicriteria Network Design Problems ⋮ The maximum \(f\)-depth spanning tree problem
This page was built for publication:
