Stackelberg Vertex Cover on a Path.

Katharina Eickhoff Lennart Kauther Britta Peis

Published in: SAGT (2023)

Keyphrases

vertex cover
approximation algorithms
partial order
precedence constraints
shortest path
np hard
minimum cost
planar graphs
partially ordered
log likelihood
optimality criterion
computational complexity
worst case
graphical models
constraint programming
polynomial time approximation