C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
Pavel Dvorák
Andreas Emil Feldmann
Dusan Knop
Tomás Masarík
Tomas Toufar
Pavel Veselý
Published in:
STACS (2018)
Keyphrases
</>
steiner tree
approximation schemes
small number
approximation algorithms
undirected graph
minimum spanning tree
shortest path
weighted graph
facility location
linear programming relaxation
special case
linear programming
knapsack problem
numerical methods
bin packing
mathematical model
spanning tree
worst case