A polynomial-time OPT^ɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki

Journal title: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Journal publisher: Society for Industrial and Applied Mathematics

Published year: 2024

Published pages: 625-638

DOI identifier: 10.1137/1.9781611977912.23