On subexponential running times for approximating directed Steiner tree and related problems.

Marek Cygan Guy Kortsarz Bundit Laekhanukit

Published in: CoRR (2018)

Keyphrases

related problems
running times
steiner tree
times faster
lower bound
worst case
minimum spanning tree
linear programming relaxation
facility location
shortest path
broadly applicable
graph theory
np hard
social network analysis