• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

-Path Vertex Cover Problem.

Eiji MiyanoToshiki SaitohRyuhei UeharaTsuyoshi YagitaTom 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