Adding Edges for Maximizing Weighted Reachability

In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nodes. We call this new problem the <i>Maximum...

詳細記述

書誌詳細

出版年:	Algorithms
主要な著者:	Federico Corò, Gianlorenzo D'Angelo, Cristina M. Pinotti
フォーマット:	論文
言語:	英語
出版事項:	MDPI AG 2020-03-01
主題:	graph augmentation approximation algorithms greedy algorithms submodularity dag trees dynamic programming
オンライン･アクセス:	https://www.mdpi.com/1999-4893/13/3/68