Ultimate greedy approximation of independent sets in subcubic graphs

DOI10.1137/1.9781611975994.87OpenAlexW2997803662MaRDI QIDQ5146864

Piotr Krysta, Nan Zhi, Mathieu Mari

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.11997

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Ultimate greedy approximation of independent sets in subcubic graphs