On approximability of connected path vertex cover
From MaRDI portal
Publication:1644919
DOI10.1007/978-3-319-89441-6_2zbMath1504.68164OpenAlexW2795299670MaRDI QIDQ1644919
Publication date: 22 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-89441-6_2
Related Items (4)
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs ⋮ Approximation algorithm for minimum weight connected-\(k\)-subgraph cover ⋮ Approximation algorithm for minimum connected 3-path vertex cover ⋮ Approximation algorithms for minimum weight connected 3-path vertex cover
This page was built for publication: On approximability of connected path vertex cover