Hochschulschrift | Online-Publikation
Approximation complexity of optimization problems
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Bonn, Univ., Diss., 2004
- Klassifikation
-
Mathematik
- Schlagwort
-
Kombinatorische Optimierung
Steiner-Problem
Approximationsalgorithmus
Berechnungskomplexität
- Urheber
- URN
-
urn:nbn:de:hbz:5N-03801
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
10.12.2049, 00:25 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
- Online-Publikation
Beteiligte
Ähnliche Objekte (12)
Approximation complexity of optimization problems
Visual complexity and intelligent computer graphics techniques enhancements
Abstract state machines : verification problems and complexity
Model-checking problems, machines and parameterized complexity
Fuzzy portfolio optimization : theory and methods
Multicriteria approximation of network design and network upgrade problems
Routing congestion in VLSI circuits : estimation and optimization
Complexity and partitions
The Angel problem, positional games, and digraph roots : strategies and complexity
Dynamic network optimization with application to the evacuation problem
Semiclassics beyond the diagonal approximation
Segmentierung und Approximation großer Punktwolken
Approximation complexity of optimization problems
Visual complexity and intelligent computer graphics techniques enhancements
Abstract state machines : verification problems and complexity
Model-checking problems, machines and parameterized complexity
Fuzzy portfolio optimization : theory and methods
Multicriteria approximation of network design and network upgrade problems
Routing congestion in VLSI circuits : estimation and optimization
Complexity and partitions
The Angel problem, positional games, and digraph roots : strategies and complexity
Dynamic network optimization with application to the evacuation problem
Semiclassics beyond the diagonal approximation
Segmentierung und Approximation großer Punktwolken
Approximation complexity of optimization problems
Visual complexity and intelligent computer graphics techniques enhancements
Abstract state machines : verification problems and complexity
Model-checking problems, machines and parameterized complexity
Fuzzy portfolio optimization : theory and methods
Multicriteria approximation of network design and network upgrade problems
Routing congestion in VLSI circuits : estimation and optimization
Complexity and partitions
The Angel problem, positional games, and digraph roots : strategies and complexity
Dynamic network optimization with application to the evacuation problem
Semiclassics beyond the diagonal approximation