Local ratio: A unified framework for approximation algorithms in memoriam: Shimon Even 1935-2004

ACM Computing Surveys

Volumn 36, Issue 4, 2004, Pages 422-463

  Bar Yehuda, Reuven ^a   Bendel, Keren ^a   Freund, Ari ^b   Rawitz, Dror ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Fractional local ratio; Local ratio technique

Indexed keywords

APPROXIMATION ALGORITHMS; FRACTIONAL LOCAL RATIO; LOCAL RATIO TECHNIQUE; WEIGHT FUNCTION;

ALGORITHMS; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

APPROXIMATION THEORY;

EID: 13644283480     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/1041680.1041683     Document Type: Review

References (78)

1. AGRAWAL, A., KLEIN, P., AND RAVI, R. 1995. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J Comput 24, 3, 440-456.
2. AKCOGLU, K., ASPNES, J., DASGUPTA, B., AND KAO, M.-Y. 2002. Opportunity cost algorithms for combinatorial auctions. In Applied Optimization: Computational Methods in Decision-Making Economics and Finance, E. J. Kontoghiorghes, B. Rustem, and S. Siokos, Eds. Kluwer Academic Publishers.
3. ALBERS, S., ARORA, S., AND KHANNA, S. 1999. Page replacement for general caching problems. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms. 31-40.
4. ARKIN, E. M. AND SILVERBERG, E. B. 1987. Scheduling jobs with fixed start and end times. Disc. Appl. Math. 18, 1-8.
5. BAFNA, V., BERMAN, P., AND FUJITO, T. 1999. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Dis. Math. 12, 3, 289-297.
6. BAFNA, V., NARAYANAN, B., AND RAVI, R. 1996. Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles). Disc. Appl. Math. 71, (Special issue on Computational Molecular Biolagy). 41-53.
7. BAR-NOY, A., BAR-YEHUDA, R., FREUND, A., NAOR, J., AND SHIEBER, B. 2001a. A unified approach to approximating resource allocation and schedualing. J. ACM 48, 5, 1069-1090.
8. BAR-NOY, A., GUHA, S., KATZ, Y., NAOR, J., SCHIEBER, B., AND SHACHNAI, H. 2002. Throughput maximization of real-time scheduling with batching. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 742-751.
9. BAR-NOY, A., GUHA, S., NAOR, J., AND SCHIEBER, B. 2001b. Approximating the throughput of multiple machines in real-time scheduling. SIAMJ. Comput. 31, 2, 331-352.
10. BAR-YEHUDA. 2001, Using homogeneous weights for approximating the partial cover problem. J. Algor. 39, 137-144.
11. BAR-YEHUDA, R. 2000. One for the price of two: A unified approach for approximating covering problems. Algorithmica 27, 2, 131-144.
12. BAR-YEHUDA, R. AND EVEN, S. 1981. A linear time approximation algorithm for the weighted vertex cover problem. J. Algor. 2, 198-203.
13. BAR-YEHUDA, R. AND EVEN, S. 1985. A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discr. Math. 25, 27-4:6.
14. BAR-YEHUDA, R., GEIGER, D., NAOR, J., AND ROTH, R. M. 1998. Approximation algorithms for the feed-back vertex set problem with applications to constraint satisfaction and bayesian inference. SIAM J. Comput. 27, 4, 942-959.
15. BAR-YEHUDA, R., HALLDÓRSSON, M. M., NAOR, J., SHACHNAI, H., AND SHAPIRA, I. 2002. Scheduling split intervals. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 732-741.
16. BAR-YEHUDA, R. AND RAWITZ, D. 2001. On the equivalence between the primal-dual schema and the local-ratio technique. In 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 2129. 24-35.
17. BAR-YEHUDA, R. AND RAWITZ, D. 2002. Approximating element-weighted vertex deletion problems for the complete k-partite property. J. Algor. 42, 1, 20-40.
18. BAR-YEHUDA, R. AND RAWITZ, D. 2004. Local ratio with negative weights. Oper. Resear. Letters 32, 6, 540-546.
19. BECKER, A. AND GEIGER, D. 1996. Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83, 1, 167-188.
20. BERMAN, P. AND DASGUPTA, B. 2000. Multi-phase algorithms for throughput maximization for real-time scheduling. J. Combin. Optimi. 4, 3, 307-323.
21. BERTSIMAS, D. AND TEO, C. 1998. From valid inequalities to heuristics: A unified view of primaldual approximation algorithms in covering problems. Operat. Resear. 46, 4, 503-514.
22. BHATIA, R., CHUZHOY, J., FREUND, A., AND NAOR, J. 2003. Algorithmic aspects of bandwidth trading. In 30th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 2719. 751-766.
23. BSHOUTY, N. H. AND BURROUGHS, L. 1998. Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In 15th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1373. Springer, 298-308.
24. CAI, M., DENG, X., AND ZANG, W. 2001. An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Comput. 30, 6, 1993-2007.
25. CHUDAK, F. A., GOEMANS, M. X., HOCHBAUM, D. S., AND WILLIAMSON, D. P. 1998. A primal-dual interpretation of recent 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Operat. Resear. Letters 22, 111-118.
26. CHUZHOY, J., OSTROVSKY, R., AND RABANI, Y. 2001. Approximation algorithms for the job interval selection problem and related scheduling problems. In 42nd IEEE Symposium on Foundations of Computer Science. 348-356.
27. CHVÁTAL, V. 1979. A greedy heuristic for the setcovering problem. Math. Operat. Resear. 4, 3, 233-235.
28. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. The MIT Press.
29. DINUR, I. AND SAFRA, S. 2002. The importance of being biased. In 34th ACM Symposium on the Theory of Computing. 33-42.
30. ERDÖS, P. AND PÓSA, L. 1962. On the maximal number of disjoint circuits of a graph. Publ. Math. Debrecen 9, 3-12.
31. EVEN, S. 1979. Graph Algorithms. Computer Science Press.
32. FEIGE, U. 1996. A threshold of hi n for approximating set cover. In 28th Annual Symposium on the Theory of Computing. 314-318.
33. FORD, L. R. AND FULKERSON, D. R. 1956. Maximal flow through a network. Canadian J. Math. 8, 399-404.
34. FREUND, A. AND RAWITZ, D. 2003. Combinatorial interpretations of dual fitting and primal fitting. In 1st International Workshop on Approximation and Online Algorithms. Lecture Notes in Computer Science, vol. 2909. Springer-Verlag, 137-150.
35. FUJITO, T. 1998. A unified approximation algorithm for node-deletion problems. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 86, 213-231.
36. GABOW, H. N., GOEMANS, M. X., AND WILLIAMSON, D. P. 1993. An efficient approximation algorithm for the survivable network design problem. In 3rd MPS Conference on Integer Programming and Combinatorial Optimization.
37. GANDHI, R., KHULLER, S., AND SRINIVASAN, A. 2001. Approximation algorithms for partial covering problems. In 28th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2076, 225-236.
38. GAREY, M. R., GRAHAM, R. L., JOHNSON, D. S., AND YAO, A. C.-C. 1976a. Resource constrained scheduling as generalized bin packing. J. Combin. Theor. (A) 21, 257-298.
39. GAREY, M. R., GRAHAM, R. L., AND ULLMAN, J. D. 1972. Worst-case analysis of memory allocation algorithms. In 4th Annual ACM Symposium on Theory of Computing. 143-150.
40. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman and Company.
41. GAREY, M. R., JOHNSON, D. S., AND STOCKMEYER, L. 1976b. Some simplified np-complete graph problems. Theo. Comput. Sci. 1, 237-267.
42. GOEMANS, M. X., GOLDBERG, A., S.PLOTKIN, SHMOYS, D., TARDOS, E., AND WILLIAMSON, D. P. 1994. Improved approximation algorithms for network design problems. In 5th Annual ACM-SIAM Symposium on Discrete Algorithms. 223-232.
43. GOEMANS, M. X. AND WILLIAMSON, D. P. 1995. A general approximation technique for constrained forest problems. SIAM J. Comput. 24, 2, 296-317.
44. GOEMANS, M. X. AND WILLIAMSON, D. P. 1997. The primal-dual method for approximation algorithms and its application to network design problems. See Hochbaum [1997], Chapter 4, 144-191.
45. GOLUMBIC, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press.
46. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1988. Geometric algorithms and combinatorial optimization. Springer-Verlag, Berlin.
47. GUHA, S., HASSIN, R., KHULLER, S., AND OR, E. 2002. Capacitated vertex covering with applications. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms. 858-865.
48. HALPERIN, E. 2000. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 329-337.
49. 1-ε. In 37th IEEE Symposium on Foundations of Computer Science. 627-636.
50. HÅSTAD, J. 1997. Some optimal inapproximability results. In 29th Annual ACM Symposium on the Theory of Computing. 1-10.
51. HOCHBAUM, D. S. 1982. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11, 3, 555-556.
52. HOCHBAUM, D. S. 1983. Efficient bounds for the stable set, vertex cover and set packing problems. Disc. App. Math. 6, 243-254.
53. HOCHBAUM, D. S. 1997. In Approximation Algorithms for NP-Hard Problem, D. S. Hochbaum Ed. PWS Publishing Company.
54. HOCHBAUM, D. S. 1998. Approximating clique and biclique problems. J. Algor. 29, 1, 174-200.
55. HOCHBAUM, D. S. 2002. Solving integer programs over monotone inequalities in three variables: a framework of half integrality and good approximations. European J. Oper. Resear. 140, 2, 291-321.
56. IMIELIŃSKA, C., KALANTARI, B., AND KHACHIYAN, L. 1993. A greedy heuristic for a minimum-weight forest problem. Operat. Resear. Letters 14, 65-71.
57. JAIN, K. 1998. A factor 2 approximation algorithm for the generalized steiner network problem. In 39th IEEE Symposium on Foundations of Computer Science. 448-457.
58. JAIN, K., MAHDIAN, M., AND SABERI, A. 2002. A new greedy approach for facility location problems. In 34th ACM Symposium on the Theory of Computing. 731-740.
59. JOHNSON, D. S. 1974. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256-278.
60. KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York, 85-103.
61. KEARNS, M. 1990. The Computational Complexity of Machine Learning. M.I.T. Press.
62. KRUSKAL, J. 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. In The American Mathematical Society. Vol. 7, 48-50.
63. LAPORTE, G. 1988. Location-routing problems. In Vehicle Routing: Methods and Studies, B. L. Golden and A. A. Assad, Eds. 163-197.
64. LAPORTE, G., NOBERT, Y., AND PELLETIER, P. 1983. Hamiltonian location problems. European J. Oper. Resear. 12, 82-89.
65. LEWIS, J. M. AND YANNAKAKIS, M. 1980. The node-deletion problem for hereditary problems is NP-complete. J. Comput. Syst. Sci. 20, 219-230.
66. LOVÁSZ, L. 1975. On the ratio of optimal integral and fractional covers. Discr. Math. 13, 383-390.
67. LUND, C. AND YANNAKAKIS, M. 1993. The approximation of maximum subgraph problems. In 20th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 700. 40-51.
68. MONIEN, B. AND SHULTZ, R. 1981. Four approximation algorithms for the feedback vertex set problem. In 7th Conference on Graph Theoretic Concepts of Computer Science. 315-390.
69. MONIEN, B. AND SPECKENMEYER, E. 1985. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inform. 22, 115-123.
70. NEMHAUSER, G. L. AND TROTTER, L. E. 1975. Vertex packings: structural properties and algorithms. Math. Programm. 8, 232-248.
71. NICHOLSON, T. T. J. 1966. Finding the shortest route between two points in a network. Comput. J. 9, 275-280.
72. RAVI, R. AND KLEIN, P. 1993. When cycles collapse: A general approximation technique for constrained two-connectivity problems. In 3rd Conference on Integer Programming and Combinatorial Optimization. 39-56.
73. ROSENKRANTZ, D. J., STEARNS, R. E., AND LEWIS, II, P. M. 1977. An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6, 3, 563-581.
74. SLAVÍK, P. 1997. Improved performance of the greedy algorithm for partial cover. Inform. Process. Letters 64, 5, 251-254.
75. SPIEKSMA, F. C. R. 1999. On the approximability of an interval scheduling problem. J. Schedul. 2, 5, 215-227.
76. WEST, D. AND SHMOYS, D. 1984. Recognizing graphs with fixed interval number is NP-complete. Dis. Appl. Math. 8, 295-305.
77. WILLIAMSON, D. P. 2002. The primal dual method for approximation algorithms. Mathemat. Programm. (Series B) 91, 3, 447-478.
78. WILLIAMSON, D. P., GOEMANS, M. X., MIHAIL, M., AND VAZIRANI, V. V. 1995. A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15, 435-454.