Analysis of the greedy approach in problems of maximum k‐coverage
暂无分享,去创建一个
[1] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[2] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[5] N. Megiddo,et al. The Maximum Coverage Location Problem , 1983 .
[6] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[7] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[9] KENNETH J. SUPOWIT,et al. Finding a Maximum Planar Subset of a Set of Nets in a Channel , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[10] Nathan Linial,et al. Graph products and chromatic numbers , 1989, 30th Annual Symposium on Foundations of Computer Science.
[11] Chak-Kuen Wong,et al. Layer assignment for multichip modules , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[12] Jason Cong,et al. On the k-layer planar subset and via minimization problems , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..
[13] Francisco Barahona,et al. Habitat Dispersion in Forest Planning and the Stable Set Problem , 1992, Oper. Res..
[14] Sheng-Roan Kai,et al. Design and Implementation of an Interactive Optimization System for Telephone Network Planning , 1992, Oper. Res..
[15] Richard Loulou. Minimal cut cover of a graph with an application to the testing of electronic boards , 1992, Oper. Res. Lett..
[16] Michael Bussieck. The Minimal Cut Cover of a Graph , 1994 .
[17] Remo Guidieri. Res , 1995, RES: Anthropology and Aesthetics.
[18] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[19] Leslie A. Hall,et al. Approximation algorithms for scheduling , 1996 .
[20] Gang Yu,et al. Approximation Algorithms for the k-Clique Covering Problem , 1996, SIAM J. Discret. Math..
[21] D. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .
[22] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .