An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
暂无分享,去创建一个
[1] Andrzej Czygrinow. Maximum dispersion problem in dense graphs , 2000, Oper. Res. Lett..
[2] Jon M. Kleinberg,et al. An improved approximation ratio for the minimum latency problem , 1996, SODA '96.
[3] Barun Chandra,et al. Approximation Algorithms for Dispersion Problems , 2001, J. Algorithms.
[4] Uriel Feige,et al. The Dense k -Subgraph Problem , 2001, Algorithmica.
[5] Michael Kuby. Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems , 1988 .
[6] Sándor P. Fekete,et al. Approximation of Geometric Dispersion Problems , 1998, Algorithmica.
[7] Aranyak Mehta,et al. AdWords and Generalized On-line Matching , 2005, FOCS.
[8] Takeshi Tokuyama,et al. Finding subsets maximizing minimum structures , 1995, SODA '95.
[9] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[10] Evangelos Markakis,et al. A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.
[11] Arie Tamir,et al. Obnoxious Facility Location on Graphs , 1991, SIAM J. Discret. Math..
[12] S. S. Ravi,et al. Heuristic and Special Case Algorithms for Dispersion Problems , 1994, Oper. Res..
[13] S. S. Ravi,et al. Facility Dispersion Problems Under Capacity and Cost Constraints , 2000, J. Comb. Optim..
[14] Evangelos Markakis,et al. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.
[15] Sándor P. Fekete,et al. Maximum Dispersion and Geometric Maximum Weight Cliques , 2003, Algorithmica.
[16] Amin Saberi,et al. A new greedy approach for facility location problems , 2002, STOC '02.
[17] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.
[18] Refael Hassin,et al. Approximation algorithms for maximum dispersion , 1997, Oper. Res. Lett..
[19] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .