Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications
From MaRDI portal
Publication:5200508
DOI10.1007/978-3-642-34611-8_23zbMath1330.68347OpenAlexW2117054620MaRDI QIDQ5200508
Publication date: 6 November 2012
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_23
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
This page was built for publication: Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications