Hochschulschrift | Online-Publikation
Approximation complexity of optimization problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Bonn, Univ., Diss., 2004
- Classification
-
Mathematik
- Keyword
-
Kombinatorische Optimierung
Steiner-Problem
Approximationsalgorithmus
Berechnungskomplexität
- Creator
- URN
-
urn:nbn:de:hbz:5N-03801
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:48 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
- Online-Publikation
Associated
Other Objects (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