Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs.

Carsten Moldenhauer

Published in: ICALP (1) (2011)

Keyphrases

approximation algorithms
primal dual
planar graphs
undirected graph
vertex cover
np hard
special case
worst case
minimum cost
edge weights
approximation ratio
weighted graph
graph structure
valid inequalities
lower bound
spanning tree
shortest path
pairwise