Sign in
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:
Networks (2020)
Keyphrases
</>
spanning tree
edge disjoint
minimum cost
minimum total cost
parameterized complexity
minimum spanning tree
total cost
np hard
minimum spanning trees
minimum weight
undirected graph
approximation algorithms
fixed parameter tractable
database systems
weighted graph
global constraints