scientific article; zbMATH DE number 1670859
From MaRDI portal
Publication:2754183
Recommendations
- Approximating \(k\)-spanner problems for \(k>2\)
- scientific article; zbMATH DE number 1757950
- Lowest-degree k-spanner: approximation and hardness
- scientific article; zbMATH DE number 6696497
- scientific article; zbMATH DE number 1182768
- On the hardness of approximating spanners
- The hardness of approximating spanner problems
- scientific article; zbMATH DE number 1629828
- Label cover instances with large girth and the hardness of approximating basic \(k\)-spanner
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
Cited in
(16)- The hardness of approximating spanner problems
- Graph spanners: a tutorial review
- Label cover instances with large girth and the hardness of approximating basic \(k\)-spanner
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Transitive-closure spanners: a survey
- scientific article; zbMATH DE number 1757950 (Why is no real title available?)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge
- Approximating \(k\)-spanner problems for \(k>2\)
- Lowest-degree k-spanner: approximation and hardness
- scientific article; zbMATH DE number 6696497 (Why is no real title available?)
- Approximating Shortest Paths in Graphs
- Improved approximation for the directed spanner problem
- Improved approximation algorithms for label cover problems
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754183)
