scientific article
From MaRDI portal
Publication:2969610
DOI10.4230/LIPICS.APPROX-RANDOM.2014.80zbMath1360.68900MaRDI QIDQ2969610
Publication date: 22 March 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs ⋮ Unnamed Item ⋮ Distributed Spanner Approximation ⋮ Unnamed Item
This page was built for publication: