Approximating independent sets in sparse graphs
From MaRDI portal
Publication:5363078
DOI10.1137/1.9781611973730.1zbMath1372.68295OpenAlexW4236357095MaRDI QIDQ5363078
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.1
Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (4)
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines ⋮ A fast approximation algorithm for the maximum 2-packing set problem on planar graphs ⋮ Unnamed Item ⋮ Semidefinite and linear programming integrality gaps for scheduling identical machines
This page was built for publication: Approximating independent sets in sparse graphs
