Login / Signup
Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs.
Jaroslaw Byrka
Mateusz Lewandowski
Carsten Moldenhauer
Published in:
CoRR (2016)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
np hard
undirected graph
steiner tree
special case
worst case
prize collecting
minimum cost
partial order
precedence constraints
directed graph
optimization problems
mixed integer programming