Publication:5111862
From MaRDI portal
DOI10.4230/LIPIcs.IPEC.2017.3zbMath1443.68119arXiv1703.01686MaRDI QIDQ5111862
Christophe Paul, Didem Gözüpek, Mordechai Shalom, Ignasi Sau, Dimitrios M. Thilikos, Julien Baste
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1703.01686
dynamic programming; treewidth; parameterized complexity; FPT algorithm; minimum-diameter spanning tree; reload-cost problems
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q27: Parameterized complexity, tractability and kernelization
