Login / Signup
Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs.
Jaroslaw Byrka
Mateusz Lewandowski
Carsten Moldenhauer
Published in:
SWAT (2016)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
np hard
undirected graph
steiner tree
worst case
prize collecting
special case
primal dual
partial order
minimum cost
optimization problems
precedence constraints
objective function
constraint satisfaction problems