Towards a general principle of evaluation for approximate algorithms
RAIRO. Informatique théorique, Tome 13 (1979) no. 3, pp. 227-239. 
@article{ITA_1979__13_3_227_0,
     author = {Aiello, A. and Burattini, E. and Massarotti, A. and Ventriglia, F.},
     title = {Towards a general principle of evaluation for approximate algorithms},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {227--239},
     publisher = {EDP-Sciences},
     volume = {13},
     number = {3},
     year = {1979},
     mrnumber = {554684},
     zbl = {0414.68010},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1979__13_3_227_0/}
}
TY  - JOUR
AU  - Aiello, A.
AU  - Burattini, E.
AU  - Massarotti, A.
AU  - Ventriglia, F.
TI  - Towards a general principle of evaluation for approximate algorithms
JO  - RAIRO. Informatique théorique
PY  - 1979
SP  - 227
EP  - 239
VL  - 13
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1979__13_3_227_0/
LA  - en
ID  - ITA_1979__13_3_227_0
ER  - 
%0 Journal Article
%A Aiello, A.
%A Burattini, E.
%A Massarotti, A.
%A Ventriglia, F.
%T Towards a general principle of evaluation for approximate algorithms
%J RAIRO. Informatique théorique
%D 1979
%P 227-239
%V 13
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1979__13_3_227_0/
%G en
%F ITA_1979__13_3_227_0
Aiello, A.; Burattini, E.; Massarotti, A.; Ventriglia, F. Towards a general principle of evaluation for approximate algorithms. RAIRO. Informatique théorique, Tome 13 (1979) no. 3, pp. 227-239. http://www.numdam.org/item/ITA_1979__13_3_227_0/

1. A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia, A New Evaluation Function for Approximation Algorithms, Proc. Informatica 77, Bled Yugoslavia, 1977.

2. A. Aiello, E. Burattini, A. Massarotti et F. Ventriglia, On the Optimization Problems Approximation, Proc. Informatica 78, Bled Yugoslavia, 1978.

3. A. Aiello, E. Burattini, A. Massarotti et F. Ventriglia, Sulla struttura dei problemi combinatoriali, Convegno "Complessita' di calcolo, modelli gestionali e territorio", Arco Felice(NA), 14-15 Giugno 1977.

4. D.S. Johnson, Approximation Algorithms for Combinatorial Problems, J. of Computer and System Science, Vol. 9, 1974, pp. 256-278. | MR | Zbl

5. R. M. Karp, Reducibility Among Combinatorial Problems. In Complexity of Computer Computations. R. E. Miller and J. W. Thatcher, Eds., Plenum Press, NewYork, 1972, pp.85-104. | MR | Zbl

6. S. Sahni et T. Gonzalez, P-Complete Approximation Problems, J. Assoc. Comput. Mach., Vol. 23, 1976, pp. 555-565. | MR | Zbl