On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science

Volumn 158, Issue 1-2, 1996, Pages 117-141

  Demange, Marc ^a,b   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; POLYNOMIALS;

APPROXIMATION RATIO; COMBINATORIAL APPROXIMATION;

APPROXIMATION THEORY;

EID: 0030143697     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00060-7     Document Type: Article

References (17)

1. A. Aiello, E. Burattini, A. Massarotti and F. Ventriglia, A new evaluation function for approximation algorithms, Sem. IRIA, 1977.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, Proc. FOCS'92 (1992) 14-23.
3. G. Ausiello, A.D'Atri and M. Protasi, Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21 (1980) 136-153.
4. C. Berge, Graphs and Hyper graphs (North-Holland, Amsterdam, 1973).
5. B. Bollobás, Random Graphs (Academic Press, London, 1985).
6. M. Demange, Approximation polynomiale de problèmes NP-complets et programmation linéaire: une nouvelle mesure d'approximation et algorithmes, Ph.D. Thesis, CERMSEM, Université de Paris I, 1994.
7. M. Demange, P. Grisoni and V. Th. Paschos, Quelques résultats dans le cadre d'une nouvelle théorie de l'approximation polynomiale, Comptes Rendus de l'Académie des Sciences de Paris 318(I) (1994) 289-292.
8. M. Demange and V. Th. Paschos, Quelques étapes vers la conciliation de la théorie d'approximation et celle d'optimisation: une nouvelle théorie d'approximation polynomiale et résultats préliminaires, Comptes Rendus de l'Académie des Sciences de Paris 317(I) (1993) 409-414.
9. M. Demange and V. Th. Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Cahier du LAMSADE 116, Université Paris-Dauphine, 1993.
10. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
11. M. Gondran and M. Minoux, Graphes et Algorithmes (Eyrolles, Paris, 1985).
12. O.H. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM 22(4) (1975) 463-468.
13. G.L. Nemhauser, L.A. Wolsey and M.L. Fischer, An analysis of approximations for maximizing submodular set functions, Math. Programming 14 (1978) 265-294.
14. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice Hall, Englewood Cliffs, NJ, 1981).
15. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
16. S. Sahni and T. Gonzales, P-complete approximation problems, J. ACM 23(3) (1976) 555-565.
17. H.U. Simon, On approximate solutions for combinatorial optimization problems, SIAM J. Discrete Math. 3(2) (1990) 294-310.