Abstract
We introduce polylinking networks, which is a flow model based on polylinking systems that generalizes the classical flow model of Ford and Fulkerson on acyclic networks and has applications in the context of wireless networks. More precisely, a flow model recently introduced by Avestimehr et al. (Proceedings of the Allerton conference on communication, control, and computing 2007) used in the context of wireless information networks is a special case of the presented model. We define a notion of source-destination cut and derive a max-flow min-cut theorem. Additionally, we present various properties of polylinking networks that can be seen as generalizations of properties for classical flows. Using submodular function minimization and submodular flow algorithms, one can efficiently determine a maximum flow, a minimum source-destination cut, as well as a minimum cost flow. These algorithms lead to new efficient algorithms for the information flow model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amaudruz, A., Fragouli, C.: Combinatorial algorithms for wireless information flow. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 555–564 (2009)
Avestimehr, A.S., Diggavi, S.N., Tse, D.N.C.: A deterministic approach to wireless relay networks. In: Proceedings of the Allerton Conference on Communication, Control, and Computing (2007). http://licos.epfl.ch/index.php?p=research_projWNC
Avestimehr, A.S., Diggavi, S.N., Tse, D.N.C.: Wireless network information flow. In: Proceedings of the Allerton Conference on Communication, Control, and Computing (2007). http://licos.epfl.ch/index.php?p=research_projWNC
Commenges D., Monsion M.: Fast inversion of triangular Toeplitz matrices. IEEE Trans. Autom. Control AC-29, 250–251 (1984)
Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A.: Combinatorial Optimization. Wiley, New York (1998)
Cunningham W.H.: Improved bounds for matroid partition and intersection. SIAM J. Comput. 15, 948–957 (1986)
Edmonds J., Giles R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)
Fleischer, L., Iwata, S.: Improved algorithms for submodular function minimization and submodular flow. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 107–116 (2000)
Goemans, M.X., Iwata, S., Zenklusen, R.: An algorithmic framework for wireless information flow. In: Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing (2009)
Kung J.P.S.: Bimatroids and invariants. Adv. Math. 30, 238–249 (1978)
Preparata F.P., Sarwate D.V.: Computational complexity of Fourier transforms over finite fields. Math. Comput. 31(139), 740–751 (1977)
Yazdi, S.M.S.T., Savari, S.A.: A max-flow/min-cut algorithm for a class of wireless networks. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’10, pp. 1209–1226. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2010)
Schrijver, A.: Matroids and linking systems. Ph.D. thesis, Mathematisch Centrum (1978)
Schrijver A.: Matroids and linking systems. J. Comb. Theory Ser. B 26(3), 349–369 (1979)
Schrijver A.: Combinatorial Optimization—Polyhedra and Efficiency. Springer, Berlin (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
An earlier shorter version of this article [9] focused mainly on the relation between the ADT model and linking flows.
M. X. Goemans was supported by NSF contract CCF-0829878 and by ONR grant N00014-05-1-0148.
R. Zenklusen was supported by the Swiss National Science Foundation, grant number: PBEZP2-129524.
Rights and permissions
About this article
Cite this article
Goemans, M.X., Iwata, S. & Zenklusen, R. A flow model based on polylinking system. Math. Program. 135, 1–23 (2012). https://doi.org/10.1007/s10107-011-0446-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-011-0446-2