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. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Networks, 75(3):259-277, 2020. [doi]

@article{BasteGPSST20,
  title = {Parameterized complexity of finding a spanning tree with minimum reload cost diameter},
  author = {Julien Baste and Didem Gözüpek and Christophe Paul and Ignasi Sau and Mordechai Shalom and Dimitrios M. Thilikos},
  year = {2020},
  doi = {10.1002/net.21923},
  url = {https://doi.org/10.1002/net.21923},
  researchr = {https://researchr.org/publication/BasteGPSST20},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {75},
  number = {3},
  pages = {259-277},
}