Approximating Non-Uniform Sparsest Cut Via Generalized Spectra
暂无分享,去创建一个
[1] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..
[2] James R. Lee,et al. Euclidean distortion and the sparsest cut , 2005, STOC '05.
[3] Kevin J. Lang,et al. An algorithm for improving graph partitions , 2008, SODA '08.
[4] Venkatesan Guruswami,et al. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[5] Leo Grady,et al. Uninitialized, globally optimal, graph-based rectilinear shape segmentation - the opposing metrics method , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[6] Baruch Awerbuch,et al. Sparse Partitions (Extended Abstract , 1990, FOCS 1990.
[7] Sanjeev Arora,et al. New Tools for Graph Coloring , 2011, APPROX-RANDOM.
[8] Prasad Raghavendra,et al. Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.
[9] Jean B. Lasserre,et al. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs , 2002, SIAM J. Optim..
[10] Anupam Gupta,et al. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.
[11] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[12] Venkatesan Guruswami,et al. Faster SDP Hierarchy Solvers for Local Rounding Algorithms , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[13] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[14] Baruch Awerbuch,et al. Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[15] Sanjeev Arora,et al. Subexponential Algorithms for Unique Games and Related Problems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[16] Frank Thomson Leighton,et al. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[17] Yuval Rabani,et al. An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..
[18] Alexandra Kolla. Spectral Algorithms for Unique Games , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[19] Luis Rademacher,et al. Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[20] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[21] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.