C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter.
Julien Baste
Didem Gözüpek
Christophe Paul
Ignasi Sau
Mordechai Shalom
Dimitrios M. Thilikos
Published in:
IPEC (2017)
Keyphrases
</>
spanning tree
edge disjoint
minimum cost
minimum total cost
parameterized complexity
minimum spanning tree
np hard
total cost
approximation algorithms
minimum weight
undirected graph
minimum spanning trees
fixed parameter tractable
computational complexity
constraint satisfaction
weighted graph