Maximum dispersion and geometric maximum weight cliques
暂无分享,去创建一个
[1] Guy Kortsarz,et al. On choosing a dense subgraph , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[2] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[3] Barun Chandra,et al. Facility Dispersion and Remote Subgraphs , 1995, SWAT.
[4] Johan Håstad,et al. Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..
[5] E. Erkut. The discrete p-dispersion problem , 1990 .
[6] S. S. Ravi,et al. Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..
[7] Marek Karpinski,et al. Polynomial time approximation schemes for dense instances of NP-hard problems , 1995, STOC '95.
[8] Hisao Tamaki,et al. Greedily Finding a Dense Subgraph , 2000, J. Algorithms.
[9] Anand Srivastav,et al. Finding Dense Subgraphs with Semidefinite Programming , 1998, APPROX.
[10] Peter Gritzmann,et al. Largestj-simplices inn-polytopes , 1995, Discret. Comput. Geom..
[11] Barun Chandra,et al. Approximation Algorithms for Dispersion Problems , 2001, J. Algorithms.
[12] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[13] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[14] Arie Tamir,et al. Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..
[15] Michael A. Trick,et al. Comments on the Paper: 'Heuristic and Special Case Algorithms for Dispersion Problems' by S. S. Ravi, D. J. Rosenkrantz and G. K. Tayi , 1998 .
[16] Sándor P. Fekete,et al. Approximation of Geometric Dispersion Problems , 1998, Algorithmica.
[17] Refael Hassin,et al. Approximation algorithms for maximum dispersion , 1997, Oper. Res. Lett..
[18] U. Feige,et al. On the densest k-subgraph problems , 1997 .