Complexity of approximation algorithms for combinatorial problems: a survey

In this survey we examine recent results on the complexity of approximation algorithms which have appeared in Russian.

[1]  W. M. Hirsch,et al.  The fixed charge problem , 1968 .

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[4]  V. K. Leont'ev.  Study of an algorithm for solving the travelling salesman problem , 1973 .

[5]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[6]  D. J. Rosenkrantz,et al.  Approximate Algorithms for the Traveling Salesperson Problem , 1974, SWAT.

[7]  M. T. Kaufman,et al.  An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem , 1974, IEEE Transactions on Computers.

[8]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[9]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[10]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[11]  Eugene L. Lawler,et al.  Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[13]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[14]  Ellis Horowitz,et al.  Combinatorial Problems: Reductibility and Approximation , 1978, Oper. Res..

[15]  Ronald L. Graham,et al.  Performance Guarantees for Scheduling Algorithms , 1978, Oper. Res..

[16]  R. Nigmatullin.  Approximate algorithms with bounded absolute error for discrete extremal problems , 1978 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Eugene Levner,et al.  Computational Complexity of Approximation Algorithms for Combinatorial Problems , 1979, MFCS.

[19]  Eugene Levner,et al.  Fast approximation algorithms for knapsack type problems , 1980 .

[20]  D. Grigor'ev.  Application of separability and independence notions for proving lower bounds of circuit complexity , 1980 .

[21]  V. K. Leont'ev.  Discrete extremal problems , 1981 .