Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

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: Pilipczuk, Michał; van Leeuwen, Erik Jan; Wiese, Andreas

Journal title: VOLUME=112;TITLE=26th Annual European Symposium on Algorithms

Journal publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Published year: 2018

DOI identifier: 10.1007/s00453-019-00670-w

ISBN: 978-3-95977-081-1