Faster algorithms for Steiner tree and related problems : from theory to practice
- Alternative title
-
Schnellere Algorithmen für Steinerbaum und verwandte Probleme
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Dissertation, 2021
- Keyword
-
Algorithms
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Technische Universität Berlin
- (when)
-
2021
- Creator
- Contributor
-
Koch, Thorsten
Uchoa, Eduardo
Werneck, Renato
- DOI
-
10.14279/depositonce-12470
- Handle
-
11303/13694
- URN
-
urn:nbn:de:101:1-2021121506034298825354
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
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
- Rehfeldt, Daniel Markus
- Koch, Thorsten
- Uchoa, Eduardo
- Werneck, Renato
- Technische Universität Berlin
Time of origin
- 2021
Other Objects (12)
New Algorithms for Steiner Tree Reoptimization
Parameterized algorithms for stochastic Steiner tree problems
Faster Algorithms for Sparse Fourier Transform
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Faster algorithms for k-subset sum and variations
Faster algorithms for counting subgraphs in sparse graphs
Discovering faster matrix multiplication algorithms with reinforcement learning
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Better - faster - leaner : TQM concepts in business practice
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Approximate Euclidean Steiner Trees
New Algorithms for Steiner Tree Reoptimization
Parameterized algorithms for stochastic Steiner tree problems
Faster Algorithms for Sparse Fourier Transform
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Faster algorithms for k-subset sum and variations
Faster algorithms for counting subgraphs in sparse graphs
Discovering faster matrix multiplication algorithms with reinforcement learning
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Better - faster - leaner : TQM concepts in business practice
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Approximate Euclidean Steiner Trees
New Algorithms for Steiner Tree Reoptimization
Parameterized algorithms for stochastic Steiner tree problems
Faster Algorithms for Sparse Fourier Transform
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
The Steiner tree problem : a tour through graphs, algorithms, and complexity
Faster algorithms for k-subset sum and variations
Faster algorithms for counting subgraphs in sparse graphs
Discovering faster matrix multiplication algorithms with reinforcement learning
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
Better - faster - leaner : TQM concepts in business practice
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C