scientific article; zbMATH DE number 7650287

DOI10.4230/LIPIcs.ISAAC.2019.54MaRDI QIDQ5875621

Pedro Matias, James A. Liu, David Eppstein, Michael T. Goodrich

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmgraph algorithmsplanarNP-hardnessclique-width3-SATCourcelle's theorem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (7)

Polynomial Time Algorithms for Tracking Path Problems ⋮ How to catch marathon cheaters: new approximation algorithms for tracking paths ⋮ Polynomial time algorithms for tracking path problems ⋮ Improved kernels for tracking paths ⋮ Fixed-parameter tractable algorithms for tracking shortest paths ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set ⋮ Constant factor approximation for tracking paths and fault tolerant feedback vertex set

This page was built for publication: