A flow model based on polylinking system
暂无分享,去创建一个
[1] William H Cunningham,et al. Improved Bounds for Matroid Partition and Intersection Algorithms , 1986, SIAM J. Comput..
[2] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[3] Joseph P. S. Kung,et al. Bimatroids and invariants , 1978 .
[4] Serap A. Savari,et al. A max-flow/min-cut algorithm for a class of wireless networks , 2010, SODA '10.
[5] Satoru Iwata,et al. An algorithmic framework for wireless information flow , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[6] Satoru Iwata,et al. Improved algorithms for submodular function minimization and submodular flow , 2000, STOC '00.
[7] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[8] M. Monsion,et al. Fast inversion of triangular Toeplitz matrices , 1984 .
[9] Suhas N. Diggavi,et al. Wireless Network Information Flow , 2007, ArXiv.
[10] Aydin Sezgin,et al. Approximate capacity of the two-way relay channel: A deterministic approach , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[11] Alexander Schrijver,et al. Matroids and linking systems , 1979, J. Comb. Theory, Ser. B.
[12] William J. Cook,et al. Combinatorial optimization , 1997 .
[13] F. Preparata,et al. Computational Complexity of Fourier Transforms over Finite Fields , 1977 .
[14] Christina Fragouli,et al. Combinatiorial algorithms for wireless information flow , 2012, TALG.
[15] Suhas N. Diggavi,et al. A Deterministic Approach to Wireless Relay Networks , 2007, ArXiv.