Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs

DOI10.1137/1.9781611975994.141OpenAlexW2997716981MaRDI QIDQ5146930

Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi, Fedor V. Fomin

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://doi.org/10.1137/1.9781611975994.141

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Contraction bidimensionality of geometric intersection graphs ⋮ Approximation algorithm for minimum weight connected-\(k\)-subgraph cover ⋮ On the tree-depth and tree-width in heterogeneous random graphs

This page was built for publication: Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs