Approximating Min-sum Set Cover
暂无分享,去创建一个
[1] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[2] Guy Kortsarz,et al. A Matched Approximation Bound for the Sum of a Greedy Coloring , 1999, Inf. Process. Lett..
[3] R. Monteiro,et al. A projected gradient algorithm for solving the maxcut SDP relaxation , 2001 .
[4] Michael Langberg,et al. Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.
[5] Aravind Srinivasan,et al. Approximating the Domatic Number , 2002, SIAM J. Comput..
[6] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[7] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[8] Mihir Bellare,et al. On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..
[9] Uri Zwick,et al. A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems , 2001, IPCO.