Combinatorial OptimizationView this Special Issue
Abraham P. Punnen, "Minmax strongly connected subgraphs with node penalties", Advances in Decision Sciences, vol. 2005, Article ID 684573, 5 pages, 2005. https://doi.org/10.1155/JAMDS.2005.107
Minmax strongly connected subgraphs with node penalties
We propose an to find a minmax strongly connected spanning subgraph of a digraph with nodes and arcs. A generalization of this problem called the minmax strongly connected subgraph problem with node penalties is also considered. An algorithm is proposed to solve this general problem. We also discuss ways to improve the average complexity of this algorithm.
Copyright © 2005 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.