An algorithmic framework for wireless information flow
暂无分享,去创建一个
[1] William H Cunningham,et al. Improved Bounds for Matroid Partition and Intersection Algorithms , 1986, SIAM J. Comput..
[2] Satoru Iwata,et al. A simple combinatorial algorithm for submodular function minimization , 2009, SODA.
[3] Serap A. Savari,et al. A combinatorial study of linear deterministic relay networks , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).
[4] C. SIAMJ.. A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗ , 2001 .
[5] William J. Cook,et al. Combinatorial optimization , 1997 .
[6] Satoru Iwata,et al. A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.
[7] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.
[8] Suhas N. Diggavi,et al. Wireless Network Information Flow , 2007, ArXiv.
[9] Suhas N. Diggavi,et al. A Deterministic Approach to Wireless Relay Networks , 2007, ArXiv.
[10] Satoru Iwata,et al. A dual approximation approach to weighted matroid intersection , 1995, Oper. Res. Lett..
[11] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[12] Alexander Schrijver,et al. Matroids and linking systems , 1979, J. Comb. Theory, Ser. B.