Empirical study of the greedy heuristic as applied to the link selection problem

[1] V. Chvátal, A greedy heuristic for the set-covering problem, Math. Oper. Res.,4, 3, (1979) 233–235. ⇒10710.1287/moor.4.3.233Search in Google Scholar

[2] D. S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, Mass., 1997. ⇒107, 108, 113Search in Google Scholar

[3] D. B. Johnson, Approximation algorithms for combinatorial problems, J. Comp. System Sci., 9, 3 (1974) 256–278. ⇒107, 11210.1016/S0022-0000(74)80044-9Search in Google Scholar

[4] L. Lovász, On the ratio of optimal integral, and fractional covers Discrete Math.,13, 4 (1975) 383–390. ⇒11210.1016/0012-365X(75)90058-8Search in Google Scholar

[5] L. Marton, P. Pusztai, On modelling and computing traffic assignment, Proc. EURO XVII. European Conf. Operational Research, Budapest, Hungary, 2000, pp. 114. ⇒107Search in Google Scholar

[6] P. Pusztai, An application of the greedy heuristic of set cover to traffic checks, CEJOR Cent. Eur. J. Oper. Res., 16, 4 (2008) 407–414 ⇒107, 108, 115, 11910.1007/s10100-008-0067-xSearch in Google Scholar