Towards a general principle of evaluation for approximate algorithms
A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A. Aiello, E. Burattini, A. Massarotti, F. Ventriglia (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A. Marchetti Spaccamela, A. Pelaggi (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Mario Furnari, Antonio Massarotti (1988)
Stochastica
Similarity:
In this note we discuss some drawbacks of some approaches to the classification of NP-complete optimization problems. Then we analyze the Theory of Analytical Computational Complexity to gain some insight about the notions of approximation and approximate algorithms. We stress the different roles played by these notions within the theories of Analytical and Algebraic Complexity. We finally outline a possible strategy to capture a more useful notion of approximation which is inspired...
Jyrki Katajainen, Olli Nevalainen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Y. Crama, J. Van De Klundert (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: