scientific article
From MaRDI portal
Publication:2754183
zbMath0973.68525MaRDI QIDQ2754183
Publication date: 9 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
Improved approximation algorithms for label cover problems ⋮ Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems ⋮ Unnamed Item ⋮ Improved Approximation for the Directed Spanner Problem ⋮ Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences ⋮ Streaming algorithm for graph spanners-single pass and constant processing time per edge ⋮ Approximating \(k\)-spanner problems for \(k>2\) ⋮ Transitive-Closure Spanners: A Survey ⋮ A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs ⋮ Graph spanners: a tutorial review ⋮ Approximating Shortest Paths in Graphs
This page was built for publication:
