Analysis of the greedy approach in problems of maximum k-coverage

Naval Research Logistics

Volumn 45, Issue 6, 1998, Pages 615-627

  Hochbaum, Dorit S ^a   Pathria, Anu ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b HNC Software Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

GREEDY APPROACH ANALYSIS; LOGARITHMIC FACTOR;

LOGISTICS;

EID: 0032164214     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5     Document Type: Article

References (22)

1. Baker, B.S., "Approximation Algorithms for NP-Complete Problems on Planar Graphs," Journal of the ACM, 41(1), 153-180 (1994).
2. Bussieck, M., "The Minimal Cut Cover of a Graph," unpublished manuscript, March 1994.
3. Barahona, F., Weintraub, A., and Epstein, R., "Habitat Dispersion in Forest Planning and the Stable Set Problem," Operations Research, 40, 14-21 (1992).
4. Cornuejols, G., Fisher, M.L., and Nemhauser, G.L., "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms," Management Science, 23(8), 789-810 (1977).
5. Chvátal, V., "A Greedy Heuristic for the Set-Covering Problem." Mathematics of Operations Research, 4(3), 233-235 (1979).
6. Cong, J., and Liu, C.L., "On the k-Layer Planar Subset and Via Minimization Problems," in Proceedings of the European Design Automation Conference, 1990, pp. 459-463.
7. Dasgupta, B., Janardan, R., and Sherwani, N., "On the Greedy Algorithm for a Covering Problem," unpublished manuscript, February 1993.
8. Goldschmidt, O., Hochbaum, D.S., Hurken, C., and Yu, G., "Approximation Algorithms for the k-Clique Covering Problem," SIAM Journal of Discrete Mathematics, 9(3), 492-509 (1996).
9. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
10. Goemans, M.X., private communication, 1995.
11. Goemans, M.X., and Williamson, D.P., "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming," Journal of the ACM, 42(6), 1115-1145 (1995).
12. Hall, L.A., "Approximation Algorithms for Scheduling," in D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS, Boston, 1996, pp. 1-45.
13. Hochbaum, D.S., and Maass, W., "Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI," Journal of the Association for Computing Machinery, 32(1), 130-136 (1985).
14. Hochbaum, D.S., "Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems," Discrete Applied Mathematics, 6, 243-254 (1983).
15. Hochbaum, D.S., "Approximation Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems," in D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems. PWS, Boston, 1996, pp. 94-143.
16. Ho, J.M., Sarrafzadeh, M., Vijayan, G., and Wong, C.K., "Layer Assignment for Multichip Modules," IEEE Transactions on Computer-Aided Design, 9, 1272-1277 (1990).
17. Johnson, D.S., "Approximation Algorithms for Combinatorial Problems," Journal of Computer and System Sciences, 9, 256-278 (1974).
18. Loulou, R., "Minimal Cut Cover of a Graph with an Application to the Testing of Electronic Boards," Operations Research Letters, 12(5), 301-306 (1992).
19. Lipton, R.J., and Tarjan, R.E., "Applications of a Planar Separator Theorem," SIAM Journal of Computing, 9(3), 615-627 (1980).
20. Linial, N., and Vazirani, U., "Graph Products and Chromatic Numbers," in 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 124-128.
21. Megiddo, N., Zemel, E., and Hakimi, S.L., "The Maximum Coverage Location Problem," SIAM Journal of Algebraic and Discrete Methods, 4(2), 253-261 (1983).
22. Supowit, K., "Finding a Maximum Planar Subset of a Set of Nets in a Channel," IEEE Transactions on Computer-Aided Design, 6, 93-94 (1987).