- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783528067625
3528067624
- Dimensions
-
24 cm
- Extent
-
VIII, 241 S.
- Edition
-
1. ed.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 223 - 231
- Keyword
-
Steiner-Problem
Algorithmus
Komplexitätstheorie
- Event
-
Veröffentlichung
- (where)
-
Braunschweig, Wiesbaden
- (who)
-
Vieweg
- (when)
-
2002
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:41 PM 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
Time of origin
- 2002
Other Objects (12)
New Algorithms for Steiner Tree Reoptimization
Tree partite graphs and the complexity of algorithms
Parameterized algorithms for stochastic Steiner tree problems
Complexity and Approximation of the Rectilinear Steiner Tree Problem
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Faster algorithms for Steiner tree and related problems : from theory to practice
Packet Routing: Complexity and Algorithms
Complexity of Variational Quantum Algorithms
Robust Multicovers: Algorithms and Complexity
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Approximate Euclidean Steiner Trees
Generalized weighted tree similarity algorithms for taxonomy trees
New Algorithms for Steiner Tree Reoptimization
Tree partite graphs and the complexity of algorithms
Parameterized algorithms for stochastic Steiner tree problems
Complexity and Approximation of the Rectilinear Steiner Tree Problem
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Faster algorithms for Steiner tree and related problems : from theory to practice
Packet Routing: Complexity and Algorithms
Complexity of Variational Quantum Algorithms
Robust Multicovers: Algorithms and Complexity
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Approximate Euclidean Steiner Trees
Generalized weighted tree similarity algorithms for taxonomy trees
New Algorithms for Steiner Tree Reoptimization
Tree partite graphs and the complexity of algorithms
Parameterized algorithms for stochastic Steiner tree problems
Complexity and Approximation of the Rectilinear Steiner Tree Problem
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
Faster algorithms for Steiner tree and related problems : from theory to practice
Packet Routing: Complexity and Algorithms
Complexity of Variational Quantum Algorithms
Robust Multicovers: Algorithms and Complexity
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Approximate Euclidean Steiner Trees