Controller placement methods analysis
暂无分享,去创建一个
[1] Sergei Vassilvitskii,et al. How slow is the k-means method? , 2006, SCG '06.
[2] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[3] J. Vitter,et al. Approximations with Minimum Packing Constraint Violation , 1992 .
[4] Rajmohan Rajaraman,et al. Analysis of a local search heuristic for facility location problems , 2000, SODA '98.
[5] Yin Zhang,et al. Solving large-scale linear programs by interior-point methods under the Matlab ∗ Environment † , 1998 .
[6] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[7] Rob Sherwood,et al. The controller placement problem , 2012, HotSDN '12.
[8] Nick McKeown,et al. OpenFlow: enabling innovation in campus networks , 2008, CCRV.
[9] Matthew Roughan,et al. The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.
[10] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.
[11] Vijay V. Vazirani,et al. Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.
[12] Kamesh Munagala,et al. Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..
[13] Jeffrey Scott Vitter,et al. e-approximations with minimum packing constraint violation (extended abstract) , 1992, STOC '92.
[14] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[15] Kurt M. Anstreicher,et al. Linear Programming in O([n3/ln n]L) Operations , 1999, SIAM J. Optim..