Parameterized Complexity of Arc-Weighted Directed Steiner Problems

From MaRDI portal

Revision as of 06:26, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5902324

Jump to:navigation, search

DOI10.1007/978-3-642-10631-6_56zbMath1273.68174OpenAlexW1507214855MaRDI QIDQ5902324

Jiong Guo, Ondřej Suchý, Rolf Niedermeier

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_56

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On the complexity of the regenerator location problem treewidth and other parameters ⋮ Unnamed Item

This page was built for publication: Parameterized Complexity of Arc-Weighted Directed Steiner Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5902324&oldid=17108105"