On the hardness of global and local approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 88-99

  Klauck, Hartmut ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; HARDNESS; LOCAL SEARCH (OPTIMIZATION);

APPROXIMATION DEGREES; APPROXIMATION-PRESERVING REDUCTIONS; INDEPENDENT DOMINATING SET; LOCAL APPROXIMATION; LOCAL OPTIMIZATIONS; NP OPTIMIZATION PROBLEMS; OPTIMIZATION PROBLEMS; TRAVELING SALESMAN;

COST REDUCTION;

EID: 84947916160     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_123     Document Type: Conference Paper

References (16)

1. P. Berman, G. Schnitger. On the Complexity of Approximating the Independent Set Problem. Inform. and Comp., vol.96, pp. 77-94, 1992.
2. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
3. M.M. Halldórson. Approximating the minimum maximal independence number. Inf. Proc. Left., Vol.46, pp. 169-172, 1993.
4. J. Hertz, A. Krogh, R.G. Palmer. Introduction to the Theory of Neural Computation. Addison-Wesley, 1991.
5. J.J. Hopfield. Neural Networks and Physical Systems having Emergent Collective Computational Abilities, 1982. Reprinted in Anderson, Rosenfeld: Neurocomputing: Found. of Research, Cambridge, MIT-Press, 1988.
6. J.J. Hopfield, D.W. Tank. "Neural" Computation of Decisions in Optimization Problems. Biological Cybernetics, vol.52, pp. 141-152, 1985.
7. D.S. Johnson, C.H. Papadimitriou, M. Yannakakis. How Easy is Local Search? Journ. of Computer and System Sciences, vol.37, pp. 79-100, 1988.
8. V. Kann. On the Approximability of NP-complete Optimization Problems. Dissertation, NADA Stockholm, 1992.
9. V. Kann. Polynomially bounded minimization problems which are hard to approximate. Proc. 20th Int. Coll. on Automata, Lang. and Prog., pp. 52-63, 1993, Springer LNCS 700.
10. S. Khanna, R. Motwani, M. Sudhan, U. Vazirani. On Syntactic versus Computational Views of Approximability. 35th Symp. Found. Comput. Science, pp. 819-830, 1994.
11. P.G. Kolaitis, M.N. Thakur. Logical definability of NP optimization problems. Inform. and Comp., vol. 115, pp. 321-353, 1994.
12. M.W. Krentel. Structure in locally optimal solutions. 30th Symp. Found. Comput. Science, pp. 216-221, 1989.
13. P. Orponen, H. Mannila. On approximation preserving reductions: Complete problems and robust measures. Technical Report C-1987-28, Department of Computer Science, University of Helsinki.
14. C.H. Papadimitriou, A.A. Schäffer, M. Yannakakis. On the Complexity of Local Search. Proc. 22th ACM Symp. on Theory of Comp., pp. 438-445,1990.
15. C.H. Papadimitriou, M. Yannakakis. Optimization, Approximation, and Complexity Classes. Journ. of Computer and System Sciences, vol.43, pp. 425-440, 1991.
16. A.A. Schäffer, M. Yannakakis. Simple Local Search Problems that are Hard to Solve. SIAM Journal Comput., vol.20, pp. 56-87, 1991.