Weighted NP Optimization Problems: Logical Definability and Approximation Properties

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 36-56

  Zimand, Marius ^a  

^a GEORGIA SOUTHWESTERN STATE UNIVERSITY   (United States)

Author keywords

Approximation properties; Logical definability; Multi prover interactive systems; NP optimization problems

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; INTERACTIVE COMPUTER SYSTEMS; OPTIMIZATION; POLYNOMIALS;

MULTIPROVER INTERACTIVE SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032057898     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795285102     Document Type: Article

References (36)

1. +92] S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and intractability of approximation problems, in Proc. 32nd IEEE Symposium on Foundations of Computer Science, 1992, pp. 14-23.
2. [BCG92] TH. BEHRENDT, K. COMPTON, AND E. GRÄDEL, Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions, in Computer Science Logic, Selected Papers, San Miniato, Lecture Notes in Computer Science 702, Springer-Verlag, New York, 1992, pp. 43-60.
3. [Bel92] M. BELLARE, Interactive Proofs and Approximation, Technical Report IBM RC 17969, IBM Thomas J. Watson Research Center, Yorktown, NY, May 1992.
4. [BFL91] L. BABAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
5. [BGLR93] M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proc. 23th ACM Symposium on Theory of Computing, 1993, pp. 294-304.
6. [BGS95] M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and non-approximability-towards tight results, in Proc. 35th IEEE Symposium on Foundations of Computer Science, 1995, pp. 422-431. Full paper available from ECCC at http://www.eccc.uni-trier.de/eccc/.
7. [BS94] M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proc. 24th ACM Symposium on Theory of Computing, 1994, pp. 184-193.
8. [BYE81] R. BAR YEHUDA AND S. EVEN, A linear time approximation algorithm for the weighted vertex cover problem, J. Algorithms, 2 (1981), pp. 198-203.
9. [Chv79] V. CHVÁTAL, A greedy heuristics for the set covering problem, Math. Oper. Res., 4 (1979), pp. 233-235.
10. [CLR90] T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
11. [Com88] K. COMPTON, 0-1 laws in logic and combinatorics, in NATO Adv. Study Inst. on Algorithms and Order, D. Reidel, Dordrecht, the Netherlands, 1988, pp. 353-383.
12. [Con91] A. CONDON, The complexity of the max word problem and the power of one-way interactive proof systems, in Proc. 8th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 480, Springer-Verlag, New York, 1991, pp. 456-465.
13. [Fag74] R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, in Complexity of Computation, Proceedings of SIAM-AMS Symposium in Applied Mathematics, R. Karp, ed., 1974, pp. 27-41.
14. [FGL+91] U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Approximating clique is almost NP complete, in Proc. 31st IEEE Symposium on Foundations of Computer Science, 1991, pp. 2-12.
15. [FK94] U. FEIGE AND J. KILIAN, Two prover protocols - low error at affordable rates, in Proc. 24th ACM Symposium on Theory of Computing, 1994, pp. 172-183.
16. [FL92] U. FEIGE AND L. LOVÁSZ, Two-prover one round systems: Their power and their problems, in Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 733-744.
17. [FRS88] L. FORTNOW, J. ROMPEL, AND M. SIPSER, On the power of multiprover interactive protocols, in Proc. 3rd IEEE Structure in Complexity Theory Conference, pp. 156-161, 1988.
18. [GJ79] M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
19. [GM84] M. GONDRAN AND M. MINOUX, Graphs and Algorithms, Wiley, New York, 1984.
20. [GM93] E. GRÄDEL AND A. MALMSTRÖM, Approximate minimization problems and optimal solutions on random inputs, in Computer Science Logic, 7th Workshop, CSL '93, Swansea 1993, Selected Papers, Lecture Notes in Computer Science 832, Springer-Verlag, New York, 1995, pp. 139-149.
21. [Gra84] E. GRANDJEAN, The spectra of first-order sentences and computational complexity, SIAM J. Comput., 13 (1984), pp. 356-373.
22. [Hoc82] D. S. HOCHBAUM, Approximation algorithms for the set covering and vertex covering problems, SIAM J. Comput., 11 (1982), pp. 555-556.
23. [Imm89] N. IMMERMAN, Descriptive and computational complexity, in Computational Complexity Theory, Proceedings of AMS Symposium in Applied Mathematics, J. Hartmanis, ed., AMS, Providence, RI, 1989, pp. 75-91.
24. [Joh92] D. JOHNSON, The NP-completeness column: An ongoing guide, J. Algorithms, 13 (1992), pp. 502-524.
25. [KMSV94] S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI, On syntactic versus computational views of approximability. in Proc. 34th IEEE Symposium on Foundations of Computer Science, 1994, pp. 819-830.
26. [KT94] P. G. KOLAITIS AND M. N. THAKUR, Logical definability of NP optimization problems, Inform. and Comput., 115 (1994), pp. 321-353.
27. [KT95] P. G. KOLAITIS AND M. N. THAKUR, Approximation properties of NP minimization classes, J. Comput. System Sci., 50 (1995), pp. 390-411.
28. [Lau92] C. LAUTEMANN, Logical definability of NP optimization problems with monadic auxiliary predicates, in Computer Science Logic, Selected Papers, San Miniato, Lecture Notes in Computer Science 702, Springer-Verlag, New York, 1992, pp. 327-339.
29. [LY93a] C. LUND AND M. YANNAKAKIS, The approximation of maximum subgraph problems, in Proc. 20th International Colloquium on Automata, Languages, and Programming, Springer-Verlag, Berlin, 1993, pp. 40-51.
30. [LY93b] C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, in Proc. 23th ACM Symposium on Theory of Computing, 1993, pp. 286-293.
31. [Lyn82] J. LYNCH, Complexity classes and theories of finite models, Math. Systems Theory, 15 (1982), pp. 127-144.
32. [PR93] A. PANCONESI AND D. RANJAN, Quantifiers and approximation, Theoret. Comput. Sci., 107 (1993), pp. 145-163.
33. [PS94] A. POLISHCHUK AND D. SPIELMAN, Nearly-linear size holographic proofs, in Proc. 24th ACM Symposium on Theory of Computing, 1994, pp. 194-203.
34. [PY91] C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
35. [Zim93] M. ZIMAND, The Complexity of the Optimal Spanning Hypertree Problem, Technical Report 471, Dept. of Computer Science, Univ. of Rochester, NY, September 1993.
36. [Zuc93] D. ZUCKERMAN, NP-complete problems have a version that's hard to approximate, in Proc. 8th IEEE Structure in Complexity Theory Conference, 1993, pp. 305-312.