- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Dortmund, Technische Universität, Dissertation, 2017
- Classification
-
Mathematik
- Keyword
-
Hardness
Bipartite graphs
Zuordnungsproblem
Robuste Optimierung
- Event
-
Veröffentlichung
- (where)
-
Dortmund
- (who)
-
Universitätsbibliothek Dortmund
- (when)
-
2017
- Creator
- Contributor
-
Michaels, Dennis
Kaibel, Volker
- Handle
-
2003/37112
- URN
-
urn:nbn:de:101:1-2018083103422266841132
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:52 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.
Associated
- Bindewald, Viktor
- Michaels, Dennis
- Kaibel, Volker
- Universitätsbibliothek Dortmund
Time of origin
- 2017
Other Objects (12)
Robust tail assignment
Robust flight gate assignment
Algorithms and Hardness Results for Object Nets
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
Graph powers: hardness results, good characterizations and efficient algorithms
Hardness
Hardness Condensation
An Investigation of the Recoverable Robust Assignment Problem
Robust quadratic assignment problem with budgeted uncertain flows
Local, distributed approximation algorithms for geometric assignment problems
Local, distributed approximation algorithms for geometric assignment problems
Local, distributed approximation algorithms for geometric assignment problems
Robust tail assignment
Robust flight gate assignment
Algorithms and Hardness Results for Object Nets
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
Graph powers: hardness results, good characterizations and efficient algorithms
Hardness
Hardness Condensation
An Investigation of the Recoverable Robust Assignment Problem
Robust quadratic assignment problem with budgeted uncertain flows
Local, distributed approximation algorithms for geometric assignment problems
Local, distributed approximation algorithms for geometric assignment problems
Local, distributed approximation algorithms for geometric assignment problems
Robust tail assignment
Robust flight gate assignment
Algorithms and Hardness Results for Object Nets
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
Graph powers: hardness results, good characterizations and efficient algorithms
Hardness
Hardness Condensation
An Investigation of the Recoverable Robust Assignment Problem
Robust quadratic assignment problem with budgeted uncertain flows
Local, distributed approximation algorithms for geometric assignment problems
Local, distributed approximation algorithms for geometric assignment problems