Parameterized Complexity of Spanner Problems with Independent Weights and Lengths
In this paper, the parameterized complexity of the multiplicative $\alpha$-spanner problem with independent weights and lengths on undirected graphs is considered for the first time. All prior FPT results (except one on DAGs) assume basic instances (i.e., with unit weights and lengths) and are parameterized in the stre...