Approximating Minimum Linear Ordering Problems
暂无分享,去创建一个
[1] Refael Hassin,et al. An Approximation Algorithm for the Minimum Latency Set Cover Problem , 2005, ESA.
[2] Nikhil Bansal,et al. A constant factor approximation algorithm for generalized min-sum set cover , 2010, SODA '10.
[3] Gagan Goel,et al. Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[4] Yossi Azar,et al. Multiple intents re-ranking , 2009, STOC '09.
[5] Jordi Petit,et al. Experiments on the minimum linear arrangement problem , 2003, ACM J. Exp. Algorithmics.
[6] R. G. Parker,et al. The optimal linear arrangement problem: algorithms and approximation , 1997 .
[7] Stefano Leonardi,et al. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.
[8] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[9] László Lovász,et al. Approximating Min Sum Set Cover , 2004, Algorithmica.
[10] James R. Lee,et al. An improved approximation ratio for the minimum linear arrangement problem , 2007, Inf. Process. Lett..
[11] Reuven Bar-Yehuda,et al. Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems , 2001, J. Graph Algorithms Appl..
[12] Nisheeth K. Vishnoi,et al. Integrality gaps for sparsest cut and minimum linear arrangement problems , 2006, STOC '06.
[13] Uriel Feige,et al. Improved Approximation for Min-Sum Vertex Cover , 2006 .
[14] Lisa Fleischer,et al. Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2011, SIAM J. Comput..
[15] Satish Rao,et al. New approximation techniques for some ordering problems , 1998, SODA '98.
[16] Mohammad Taghi Hajiaghayi,et al. L22 Spreading Metrics for Vertex Ordering Problems , 2006, SODA.
[17] Satoru Iwata,et al. Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[18] Mohammad Taghi Hajiaghayi,et al. l22 spreading metrics for vertex ordering problems , 2006, SODA '06.
[19] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[20] Yossi Azar,et al. Ranking with submodular valuations , 2010, SODA '11.
[21] Chandra Chekuri,et al. Approximation Algorithms for Submodular Multiway Partition , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.