Towards a general principle of evaluation for approximate algorithms

A. Aiello; E. Burattini; A. Massarotti; F. Ventriglia

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1979)

  • Volume: 13, Issue: 3, page 227-239
  • ISSN: 0988-3754

How to cite

top

Aiello, A., et al. "Towards a general principle of evaluation for approximate algorithms." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 13.3 (1979): 227-239. <http://eudml.org/doc/92101>.

@article{Aiello1979,
author = {Aiello, A., Burattini, E., Massarotti, A., Ventriglia, F.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {evaluation; approximate algorithms},
language = {eng},
number = {3},
pages = {227-239},
publisher = {EDP-Sciences},
title = {Towards a general principle of evaluation for approximate algorithms},
url = {http://eudml.org/doc/92101},
volume = {13},
year = {1979},
}

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 - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1979
PB - EDP-Sciences
VL - 13
IS - 3
SP - 227
EP - 239
LA - eng
KW - evaluation; approximate algorithms
UR - http://eudml.org/doc/92101
ER -

References

top
  1. 1. A. AIELLO, E. BURATTINI, A. MASSAROTTI, F. VENTRIGLIA, A New Evaluation Function for Approximation Algorithms, Proc. Informatica 77, Bled Yugoslavia, 1977. Zbl0604.68047
  2. 2. A. AIELLO, E. BURATTINI, A. MASSAROTTI et F. VENTRIGLIA, On the Optimization Problems Approximation, Proc. Informatica 78, Bled Yugoslavia, 1978. Zbl0616.68039
  3. 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. 4. D.S. JOHNSON, Approximation Algorithms for Combinatorial Problems, J. of Computer and System Science, Vol. 9, 1974, pp. 256-278. Zbl0296.65036MR449012
  5. 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. Zbl0366.68041MR378476
  6. 6. S. SAHNI et T. GONZALEZ, P-Complete Approximation Problems, J. Assoc. Comput. Mach., Vol. 23, 1976, pp. 555-565. Zbl0348.90152MR408313

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.