Hochschulschrift
Approximation algorithms for complex network flow over time problems
- Weitere Titel
-
Approximationsalgorithmen für komplexen Netzwerkfluss über Zeit Probleme
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Diss., 2014
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2014
- Urheber
- Beteiligte Personen und Organisationen
-
Skutella, Martin
Woeginger, Gerhard J.
- URN
-
urn:nbn:de:kobv:83-opus4-47792
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:54 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
Beteiligte
- Groß, Martin
- Skutella, Martin
- Woeginger, Gerhard J.
- Technische Universität Berlin
Entstanden
- 2014
Ähnliche Objekte (12)
Approximation algorithms for network design problems
Approximation algorithms for network design problems
Approximation Algorithms
Approximation algorithms
Polynomial time algorithms for network information flow
Approximation and online algorithms for selected network optimization problems
Approximation and online algorithms for selected network optimization problems
Approximation algorithms for network design and cut problems in bounded-treewidth
On Derandomized Approximation Algorithms
Approximation algorithms for complex systems : proceedings of the 6th International Conference on Algorithms for Approximation, Ambleside, UK, 31st August - 4th September, 2009
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Approximation Algorithms via Matrix Covers
Approximation algorithms for network design problems
Approximation algorithms for network design problems
Approximation Algorithms
Approximation algorithms
Polynomial time algorithms for network information flow
Approximation and online algorithms for selected network optimization problems
Approximation and online algorithms for selected network optimization problems
Approximation algorithms for network design and cut problems in bounded-treewidth
On Derandomized Approximation Algorithms
Approximation algorithms for complex systems : proceedings of the 6th International Conference on Algorithms for Approximation, Ambleside, UK, 31st August - 4th September, 2009
Approximation algorithms for combinatorial optimization problems in graph coloring and network design
Approximation Algorithms via Matrix Covers
Approximation algorithms for network design problems
Approximation algorithms for network design problems
Approximation Algorithms
Approximation algorithms
Polynomial time algorithms for network information flow
Approximation and online algorithms for selected network optimization problems
Approximation and online algorithms for selected network optimization problems
Approximation algorithms for network design and cut problems in bounded-treewidth
On Derandomized Approximation Algorithms
Approximation algorithms for complex systems : proceedings of the 6th International Conference on Algorithms for Approximation, Ambleside, UK, 31st August - 4th September, 2009
Approximation algorithms for combinatorial optimization problems in graph coloring and network design