Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem

DOI10.1016/j.jda.2014.11.005zbMath1320.68102MaRDI QIDQ2253903

Tibor Jordán, Ildikó Schlotter

Publication date: 13 February 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.11.005

zbMATH Keywords

network design; tree-width; parameterized complexity; Steiner forest

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)