scientific article
From MaRDI portal
Publication:2728855
zbMath0971.68634MaRDI QIDQ2728855
Publication date: 1 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graph spannersapproximation algorithmshardness of approximationvariants of the sparse \(k\)-spanner problem
Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems ⋮ On the positive-negative partial set cover problem ⋮ Approximating \(k\)-spanner problems for \(k>2\) ⋮ A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
This page was built for publication:
