Multi-rooted greedy approximation of directed Steiner trees with applications

DOI10.1007/s00453-015-9973-1zbMath1336.68295MaRDI QIDQ262265

Toshihiro Fujito, Tomoya Hibi

Publication date: 29 March 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-9973-1

zbMATH Keywords

Steiner tree problem; greedy algorithm; directed graphs; approximation algorithms; tree cover problem

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms