Poly-APX- and PTAS-completeness in standard and differential approximation (Extended abstract)

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

Volumn 3341, Issue , 2004, Pages 124-136

  Bazgan, Cristina ^a   Escoffier, Bruno ^a   Paschos, Vangelis Th ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; APPROXIMATION-PRESERVING REDUCTIONS; APX-COMPLETE; COMPLETE PROBLEMS; DIFFERENTIAL APPROXIMATIONS; EXTENDED ABSTRACTS;

ARTIFICIAL INTELLIGENCE;

COMPUTER SCIENCE; COMPUTERS;

EID: 33645938817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_13     Document Type: Article

References (14)

1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)
2. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)
3. Bazgan, C., Escoffier, B., Paschos, V. Th.: Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Cahier du LAMSADE 217, LAMSADE, Universit Paris-Dauphine (2004) Available on http://www.lamsade.dauphine.fr/cahiers.html.
4. Crescenzi, P., Panconesi, A.: Completeness in approximation classes. Information and Computation 93 (1991) 241-262
5. Ausiello, G., Crescenzi, P., Protasi, M.: Approximate solutions of NP optimization problems. Theoret. Comput. Sci. 150 (1995) 1-55
6. Crescenzi, P., Trevisan, L.: On approximation scheme preserving reducibility and its applications. Theory of Computing Systems 33 (2000) 1-16
7. Ausiello, G., Bazgan, C., Demange, M., Paschos, V. Th.: Completeness in differential approximation classes. In: Mathematical Foundations of Computer Science, MFCS'03. Number 2747 in Lecture Notes in Computer Science, Springer-Verlag (2003) 179-188
8. Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On syntactic versus computational views of approximability. SIAM J. Comput. 28 (1998) 164-191
9. Ausiello, G., Bazgan, C., Demange, M., Paschos, V. Th.: Completeness in differential approximation classes. Cahier du LAMSADE 204, LAMSADE, Universit Paris-Dauphine (2003) Available on http://www.lamsade.dauphine.fr/cahiers.html.
10. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput, Mach. 41 (1994) 153-180
11. Demange, M., Monnot, J., Paschos, V. Th.: Bridging gap between standard and differential polynomial approximation: the case of bin-packing. Appl. Math. Lett. 12 (1999) 127-133
12. Orponen, P., Mannila, H.: On approximation preserving reductions: complete problems and robust measures. Technical Report C-1987-28, Dept. of Computer Science, University of Helsinki, Finland (1987
13. Halldórsson, M.M.: Approximating discrete collections via local improvements. In: Proc. Symposium on Discrete Algorithms, SODA. (1995) 160-169
14. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: Proc. Conference on Computational Complexity. (1996) 278-287