Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond.

Tesshu Hanaka Hirotaka Ono Yota Otachi Saeki Uda

Published in: CoRR (2023)

Keyphrases

vertex cover
approximation algorithms
partial order
precedence constraints
planar graphs
optimality criterion
polynomial time approximation
special case
np hard
scheduling problem
minimum cost