In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, link failures, network survivability, etc., we introduce a new notion of flow spanner, where one seeks a spanning subgraph H = (V, E′) of a graph G = (V, E) which provides a "good" approximation of the source-sink flows in G. We formulate few variants of this problem and investigate their complexities. A special attention is given to the version where H is required to be a tree. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Dragan, F. F., & Yan, C. (2006). Network flow spanners. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3887 LNCS, pp. 410–422). https://doi.org/10.1007/11682462_39
Mendeley helps you to discover research relevant for your work.