Hochschulschrift
Approximation algorithms for complex network flow over time problems
- Alternative title
-
Approximationsalgorithmen für komplexen Netzwerkfluss über Zeit Probleme
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Diss., 2014
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Technische Universität Berlin
- (when)
-
2014
- Creator
- Contributor
-
Skutella, Martin
Woeginger, Gerhard J.
- URN
-
urn:nbn:de:kobv:83-opus4-47792
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:54 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
Associated
- Groß, Martin
- Skutella, Martin
- Woeginger, Gerhard J.
- Technische Universität Berlin
Time of origin
- 2014
Other Objects (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