- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Dortmund, Technische Universität, Dissertation, 2017
- Klassifikation
-
Mathematik
- Schlagwort
-
Hardness
Bipartite graphs
Zuordnungsproblem
Robuste Optimierung
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Universitätsbibliothek Dortmund
- (wann)
-
2017
- Urheber
- Beteiligte Personen und Organisationen
-
Michaels, Dennis
Kaibel, Volker
- Handle
-
2003/37112
- URN
-
urn:nbn:de:101:1-2018083103422266841132
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 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.
Beteiligte
- Bindewald, Viktor
- Michaels, Dennis
- Kaibel, Volker
- Universitätsbibliothek Dortmund
Entstanden
- 2017
Ähnliche Objekte (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