scientific article
From MaRDI portal
Publication:2830866
DOI10.4086/TOC.2016.V012A015zbMath1393.68187OpenAlexW2585630643MaRDI QIDQ2830866
Publication date: 1 November 2016
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2016.v012a015
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) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Unnamed Item ⋮ Graph spanners: a tutorial review ⋮ Distributed Distance-Bounded Network Design Through Distributed Convex Programming ⋮ Lasserre integrality gaps for graph spanners and related problems
Cites Work
This page was built for publication:
