scientific article
From MaRDI portal
Publication:3836515
zbMath0947.68112MaRDI QIDQ3836515
Publication date: 9 December 1999
Full work available at URL: https://eudml.org/doc/120593
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Tree-decompositions with bags of small diameter ⋮ Spanners for bounded tree-length graphs ⋮ Minimum weight Euclidean \(t\)-spanner is NP-hard ⋮ Approximation of minimum weight spanners for sparse graphs ⋮ Spanners and message distribution in networks. ⋮ Spanners in sparse graphs ⋮ A distance approximating trees ⋮ Combinatorial network abstraction by trees and distances ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs ⋮ Graph spanners: a tutorial review ⋮ Network flow spanners ⋮ The non-approximability of bicriteria network design problems
This page was built for publication:
