Login / Signup
-Path Vertex Cover Problem.
Eiji Miyano
Toshiki Saitoh
Ryuhei Uehara
Tsuyoshi Yagita
Tom C. van der Zanden
Published in:
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2020)
Keyphrases
</>
vertex cover
approximation algorithms
partial order
shortest path
planar graphs
precedence constraints
optimality criterion
np hard
minimum cost
special case
polynomial time approximation