Optimal design of signaling networks for Internet telephony
暂无分享,去创建一个
[1] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[2] Harold N. Gabow,et al. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.
[3] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[4] Mark Jerrum,et al. Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..
[5] Imrich Chlamtac,et al. Virtual path network topology optimization using random graphs , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[6] John K. Ousterhout,et al. Tcl and the Tk Toolkit , 1994 .
[7] N GabowHarold. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976 .
[8] Béla Bollobás,et al. Random Graphs , 1985 .
[9] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[10] K. G. Ramakrishnan,et al. Computational results of an interior point algorithm for large scale linear programming , 1991, Math. Program..
[11] Brendan D. McKay,et al. Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.
[12] Mauricio G. C. Resende,et al. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..
[13] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[14] Hanna D. Robalewska,et al. 1-Factorizations of random regular graphs , 1997, Random Struct. Algorithms.
[15] Panos M. Pardalos,et al. Quadratic Assignment and Related Problems , 1994 .