Login / Signup
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
Pavel Dvorák
Andreas Emil Feldmann
Dusan Knop
Tomás Masarík
Tomás Toufar
Pavel Veselý
Published in:
CoRR (2017)
Keyphrases
</>
steiner tree
approximation schemes
small number
approximation algorithms
undirected graph
minimum spanning tree
facility location
shortest path
weighted graph
numerical methods
linear programming relaxation
np hard
minimum cost
bin packing
image processing
special case
level set
dynamic programming