Georgii Gens
Skip Abstract Section
Abstract
In this survey we examine recent results on the complexity of approximation algorithms which have appeared in Russian.
- L. G. Babat, "Linear Functions on the N-dimenaional Unit Cube", Dokl. Akad. Nauk SSSR 222, 761--762 (1975), (Russian).Google Scholar
- L. G. Babat, "Approximate Computation of Linear Functions on Vertices of the Unit N-dimensional Cube", in Studies in Discrets Optimization, pp. 156--169, A. A. Fridman (ed.) Nauka, Moscow, 1976 (Russian).Google Scholar
- L. G. Babat, "A Fixed-Charge Problem", Izv. Akad. Nauk SSSR, Techn. Kibernet. 3, 25--31 (1978) (Russian).Google Scholar
- I. S. Belov and Stolin Ja. I., "An Algorithm for a Flow-shop Scheduling Problem", in Mathematical Economics and Functional Analysis, pp. 218--257, B. S. Mityagin (ed.), Nauka, Moscow, 1974 (Russian).Google Scholar
- S. A. Cook, "The Complexity of Theorem Proving Procedures" Proc. 3-rd Annual ACM Symposium on the Theory of Computing, pp. 151--159, Shaker Heights, Ohio, 1971. Google ScholarDigital Library
- G. Cornuejols, M. L. Fisher and G. L. Nemhauser, "Location of Bank Accounts to Optimize Floats", Manag. Sci. 23, 789--810, (1977).Google ScholarDigital Library
- E. A. Dinic, "A Boolean Programming Problem", in Soft-Ware Systems for Optimal Planning Problems, Proc. V All-Union Symposium pp. 190--191, Central Economic and Mathematical Institute, Moscow, 1978, (Russian).Google Scholar
- E. A. Dinic, A. V. Karzanov, "A Boolean Optimization Problem with Special Constraints". Moscow, All-Union Institute of System Research, 1978 (Russian).Google Scholar
- Ju. Ju. Finkel' stein, Approximation Methods and Applied Discrete Programming Problems, Nauka, Moscow, (1976) (Russian).Google Scholar
- Ju. Ju. Finkel' stein, "An e-approach to the Multidimensional Knapsack Problem", Zur. Vychisl. Mat. i Mat. Fiz. 17, 1040--1042, (1977) (Russian).Google Scholar
- A. A. Fridman, M. A. Frumkin, Ju. I Hmelevskii and E. V. Levner, "Study of Algorithm Efficiency for Discrete and Combinatorial Problems. Theory of Problem Reducibility and Universal Problems". Report No GR-76060393, Moscow, Central Economic and Mathematical Institute, USSR Academy of Sciences. 1976 (Russian).Google Scholar
- A. A. Fridman "New Directions in Discrete Optimization", Ekon. i Mat. Metody 13, 1115--1131 (1977) (Russian).Google Scholar
- M. R. Garey, R. L. Graham and D. S. Johnson, "Performance Guarantees for Scheduling Algorithms", Oper. Res. 26, 3--21, (1978).Google ScholarDigital Library
- M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, 1979. Google ScholarDigital Library
- G. V. Gens and E. V. Levner, "On Approximation Algorithms for Universal Scheduling Problems", Izv. Akad. Nauk SSSR, Tehn. Kibernet. 6, 38--43 (1978) (Russian).Google Scholar
- G. V. Gens and E. V. Levner, "Computational Complexity of Approximation Algorithms for Combinatorial Problems", Proc. 8th Symposium on Mathematical Foundations of Computer Science, Olomouc, Czechoslovakia, (1979), Lecture Notes in Computer Science, vol. 74. Springer-Verlag. Berlin-New York, 1979.Google ScholarCross Ref
- E. H. Gimadi, N. I. Glebov and V. A. Perepelica, "Algorithms with Performance Guarantees for Discrete Optimization Problems". Problems of Cybernetics, book 31, Nauka, Moscow, 1976 (Russian).Google Scholar
- R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, "Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey", Annals of Discrete Mathematics, 5 (1978).Google Scholar
- D. Yu. Grigoryev, "An Application of Separability and Independence Notions for Proving Lower Bounds of Circuit Complexity", in Studies on Constructive Mathematics and Mathematical Logic, pp. 38--48, Yu. V. Matiyasevich and A. O. Slisenko (eds.). Zap. nauchm. seminarov Leningrad. otd. Mat. Inst. AN SSSR, 60, Nauka, Leningrad, 1976 (Russian).Google Scholar
- O. H. Ibarra, C. E. Kim "Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems", J. ACM., 22, 463--468, (1975). Google ScholarDigital Library
- D. S. Johnson, "Approximation algorithms for Combinatorial Problems", J. Comput. Systems Sci., 9, 256--278 (1974).Google ScholarDigital Library
- R. M. Karp, "Reducibility among Combinatorial Problems", in "Complexity of Computer Computations", pp. 85--109, R. E. Miller and T. W. Thatcher (eds.), Plenum Press, New York, 1972.Google ScholarCross Ref
- R. M. Karp, "The Probabilistic Analysis of Some Combinatorial Search Algorithms", in Algorithms and Complexity, pp. 1--19, J. B. Traub (ed.), Academic Press, New York, 1976.Google Scholar
- M. T. Kaufman, "An Almost-optimal Algorithm for the Assembly Line Scheduling Problem", LEEE Trans. on Comp., C-23, (1974), 1169--1174.Google ScholarDigital Library
- L. G. Khachiyan, "A Polynomial Algorithm for the Linear programming Problem", Dokl. Akad. Nauk SSSR, 244, No 5 (1979) (Russian).Google Scholar
- V. K. Korobkov, R. E. Krichevskii, "Algorithms for the Traveling Salesman Problem", in Mathematical Models and Methods of Optimal Planning, pp. 106--108, Nauka, Novosibirsk, 1966 (Russian).Google Scholar
- E. L. Lawler, "Fast Approximation Algorithms for Knapsack Problem", Memorandum No UCB/ERL M 77/45, Electronics Research Laboratory, University of California, Berkeley, June 1977.Google Scholar
- V. K. Leont'ev, "Study of an Algorithm for Solving Traveling Salesman Problem", Zur. Vych.Mat. i Mat Fiz., 13, 1228--1236 (1973) (Russian).Google Scholar
- V. K. Leont'ev, "Discrete Extremal Problems", in Theory of Probability. Mathematical Statistics. Theoretical Cybernetics, pp. 39--101, R. V. Gamkrelidze (Ed.) VINITI, Moscow, 1979, (Russian).Google Scholar
- L. A. Levin, "Universal Problems of Combinatorial Search", Problemy Peredachy Informacii, 9, 115--116, (1973) (Russian).Google Scholar
- E. V. Levner and G. V. Gens, "On ε-Algorithms for Universal Discrete Problems", Proc. IV All-Union Conf. on Problems of Theoret. Cybern., pp. 95--96, Inst. Mat., Novosibirsk, (1977).Google Scholar
- E. V. Levner, and G. V. Gens, Discrete Optimization Problems and Efficient Approximation Algorithms, Moscow, Central Economic and Mathem. Institute, 1978 (Russian).Google Scholar
- E. V. Levner and G. V. Gens. "Fast Approximation Algorithms for knapsack type problems", Proc. IX Conf. IFIP on Optimization Techniques, Warsaw, September 1979, Lecture Notes in Computer Science, Springer-Verlag, Berlin - New York. 1979.Google Scholar
- E. M. Livshic, "Analysis of Algorithms for Network Model Optimization", Ekon. i Mat. Metody, 4, 768--775 (1968) (Russian).Google Scholar
- E. M. Livashic, "Performance Bounds for Approximate Solutions of Optimization Network Problems" in Proc. I Winter School on Math. Programming, book 3, pp. 477--497, Central Economic and Mathem. Institute, Moscow, 1969 (Russian).Google Scholar
- E. M. Livshic and V. I. Rublineckii, "On Relative Complexity of Discrete Optimization Problems" in Vych. Mat i Vych. Teh. 3, 78--95, Kharkov, 1972 (Russian).Google Scholar
- R. G. Nigmatullin, "The Fastest Descent Method for Covering Problems", Proc. Symposium on Questions of Precision and Efficiency of Computer Algorithms, book 5, 116--126, Kiev, 1969 (Russian).Google Scholar
- R. G. Nigmatullin, "Complexity of Approximate Solution of Combinatorial Problems", Dokl. Akad. Nauk SSSR, 224, No 2, (1975), (Russian).Google Scholar
- R. G. Nigmatullin, "On Approximate Algorithms with Bounded Absolute Error for Discrete Extremal Problems", Kybernetika, 1, 96--101, (1978) (Russian).Google Scholar
- D. J. Rosenkrantz, R. E. Stearns and P. M. Lewis, "Approximate Algorithms for the Traveling Salesman Problem", Proc 15th Annual IEEE Symp. on Switching and Automata Theory. pp. 33--42, (1974).Google ScholarDigital Library
- V. I. Rublineckii, "On Procedures with Performance Guarantees for Traveling Salesman Problem", Vych Mat. i Vych Tehn. 4, 18--23, Kharkov, 1973 (Russian).Google Scholar
- S. Sahni, "Algorithms for Scheduling Independent Tasks", J. ACM, 23, 114--127, (1976). Google ScholarDigital Library
- S. Sahni and T. Gonzales "p - complete Approximation Problems", J. ACM, 23, 555--565 (1976). Google ScholarDigital Library
- S. Sahni and E. Horowitz. Combinatorial Problems: Reducibility and Approximation, Oper. Res. 26, 718--759 (1978).Google ScholarDigital Library
- S. V. Sevost'yanov. "On Asymtolic Approach to Scheduling Problems, in Upravl. Systemi (upravl. procesi), v. 14, Novosibirsk, Nauka, 1975, pp. 40--51. (Russian).Google Scholar
- S. B. Sevost'yanov, "On Approximate Solution of Scheduling Problems", in Metody Discret. Analyza v Synt. Uprav. System, 32, (1978), Novosibirsk, 66--75 (Russian).Google Scholar
- V. G. Vizing, "The Object Function Values in Sequencing Problems Dominated by an Average Value", Kibernetika, 5, 76--78, (1973), (Russian).Google Scholar
- D. B. Yudin, A. S. Nemirovskii, "Bounds for Information Complexity of Mathematical Programming Problems", Ekonom, i Mat. Metody. 12, 123--142, (1976) (Russian).Google Scholar
Index Terms
- Complexity of approximation algorithms for combinatorial problems: a survey
Index terms have been assigned to the content through auto-classification.
Recommendations
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Max d-Clique and Max d-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset $$S\subseteq V$$S⊆V of vertices ...
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
COCOA 2015: Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486A d-clique in a graph $$G = V, E$$G=V,E is a subset $$S\subseteq V$$S⊆V of vertices such that for pairs of vertices $$u, v\in S$$u,v∈S, the distance between u and v is at most d in G. A d-club in a graph $$G = V, E$$G=V,E is a subset $$S'\subseteq V$$S'⊆...
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
We analyze approximation algorithms for several variants of the traveling salesman problem with multiple objective functions. First, we consider the symmetric TSP (STSP) with ź-triangle inequality. For this problem, we present a deterministic ...
Comments