Login / Signup
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:
CoRR (2017)
Keyphrases
</>
spanning tree
edge disjoint
minimum cost
minimum total cost
parameterized complexity
minimum spanning tree
np hard
undirected graph
total cost
approximation algorithms
minimum weight
minimum spanning trees
weighted graph
data model
special case