Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)
Computational complexity of approximation algorithms for combinatorial problems
KeywordsApproximate Solution Approximation Algorithm Travel Salesman Problem Knapsack Problem Combinatorial Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Babat, L.G., Linear function on the N-dimensional unit cube. Dokl. Akad. Nauk SSSR, 222 (1975), 761–762.Google Scholar
- 2.Babat, L.G., A fixed-charge problem. Izv. Akad. Nauk SSSR, Engeneering Cybernetics, 3, (1978), 25–31.Google Scholar
- 3.Cornuejols G., Fisher M.L., Nemhauser G.L., Location of bank accounts to optimize floats. Manag.Sci., 23 (1977), 789–810.Google Scholar
- 4.Gens G.V., Levner E.V. Approximate algorithms for NP-hard scheduling problems. Izv. Akad. Nauk SSSR, Engineering Cybernetics 6, (1978), 38–43.Google Scholar
- 6.Karp R.M., The probabilistic analysis of some combinatorial search algorithms. In: Algorithms and Complexity (ed. Traub J.F.), (1976) 1–19.Google Scholar
- 7.Lawler E.L., Fast approximation algorithms for knapsack problems. In: Interfaces between Computer Science and Operations Research, Amsterdam, Mathematical Centre Tracts, 99, (1978).Google Scholar
- 8.Levner E.V., Gens G.V. Discrete Optimization Problems and Efficient Approximation Algorithms. Moscow, Central Economic and Mathematical Institute, USSR Academy of Sciences, (1978) (in Russian).Google Scholar
- 9.Sahni S. Algorithms for scheduling independent tasks. J.ACM, 23 (1976), 114–127.Google Scholar
© Springer-Verlag Berlin Heidelberg 1979