The Steiner tree problem : a tour through graphs, algorithms, and complexity
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783528067625
3528067624
- Maße
-
24 cm
- Umfang
-
VIII, 241 S.
- Ausgabe
-
1. ed.
- Sprache
-
Englisch
- Anmerkungen
-
Literaturverz. S. 223 - 231
- Schlagwort
-
Steiner-Problem
Algorithmus
Komplexitätstheorie
- Ereignis
-
Veröffentlichung
- (wo)
-
Braunschweig, Wiesbaden
- (wer)
-
Vieweg
- (wann)
-
2002
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:41 MESZ
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
Entstanden
- 2002
Ähnliche Objekte (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
Complexity of Variational Quantum Algorithms
Packet Routing: Complexity and 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
Complexity of Variational Quantum Algorithms
Packet Routing: Complexity and 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
Complexity of Variational Quantum Algorithms
Packet Routing: Complexity and Algorithms
Robust Multicovers: Algorithms and Complexity
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Approximate Euclidean Steiner Trees