Treffer: Approximation classes for real number optimization problems

Title:
Approximation classes for real number optimization problems
Authors:
FLARUP, Uffe, MEER, Klaus
Source:
Unconventional computation (5th international conference, UC 2006, York, UK, September 4-8, 2006)0UC 2006. :86-100
Publisher Information:
Berlin; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 11 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Théorie de la décision. Théorie de l'utilité, Decision theory. Utility theory, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Complétude, Completeness, Completitud, Modélisation, Modeling, Modelización, Méthode calcul, Computing method, Método cálculo, Nombre réel, Real number, Número real, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Rapport signal bruit, Signal to noise ratio, Relación señal ruido, Réductibilité, Reducibility, Reductibilidad, Théorie approximation, Approximation theory, Théorie décision, Decision theory, Teoría decisión, Théorie nombre, Number theory, Teoría números, Théorème existence, Existence theorem, Teorema existencia
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics and Computer Science Syddansk Universitet, Campusvej 55, 5230 Odense, Denmark
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19130931
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.19130931
Database:
PASCAL Archive

Weitere Informationen

A fundamental research area in relation with analyzing the complexity of optimization problems are approximation algorithms. For combinatorial optimization a vast theory of approximation algorithms has been developed, see [1]. Many natural optimization problems involve real numbers and thus an uncountable search space of feasible solutions. A uniform complexity theory for real number decision problems was introduced by Blum, Shub, and Smale [4]. However, approximation algorithms were not yet formally studied in their model. In this paper we develop a structural theory of optimization problems and approximation algorithms for the BSS model similar to the above mentioned one for combinatorial optimization. We introduce a class NPOR of real optimization problems closely related to NPR. The class NPOR has four natural subclasses. For each of those we introduce and study real approximation classes APXR and PTASR together with reducibility and completeness notions. As main results we establish the existence of natural complete problems for all these classes.