- Standort
-
Eichstätt, Universitätsbibliothek -- 00/SS 2004 T725#S.195-208
- Umfang
-
1 Online-Ressource (S. [195] - 208)
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
In: Exploring New Frontiers of Theoretical Informatics. - Boston [u.a.] : Kluwer, 2004
- Ereignis
-
Veröffentlichung
- (wo)
-
Boston [u.a.]
- (wer)
-
Kluwer
- (wann)
-
2004
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bvb:12-bsb00079548-2
- Letzte Aktualisierung
-
16.04.2025, 08:37 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Bayerische Staatsbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Bayerische Staatsbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Dementiev, Roman
- Sanders, Peter
- Kluwer
Entstanden
- 2004
Ähnliche Objekte (12)
Weight-Constrained Minimum Spanning Tree Problem
Simulated annealing algorithm for the robust spanning tree problem
Ant colony optimization and the minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Algorithms for the minimum spanning tree problem with resource allocation
On the complexity of the bilevel minimum spanning tree problem
Bounded degree spanning trees
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Inferring phylogenetic trees under the general Markov model via a minimum spanning tree backbone
Contagion pattern identification through minimum spanning trees during the Asian financial crisis
Erweiterung des Spanning Tree Simulators
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Weight-Constrained Minimum Spanning Tree Problem
Simulated annealing algorithm for the robust spanning tree problem
Ant colony optimization and the minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Algorithms for the minimum spanning tree problem with resource allocation
On the complexity of the bilevel minimum spanning tree problem
Bounded degree spanning trees
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Inferring phylogenetic trees under the general Markov model via a minimum spanning tree backbone
Contagion pattern identification through minimum spanning trees during the Asian financial crisis
Erweiterung des Spanning Tree Simulators
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Weight-Constrained Minimum Spanning Tree Problem
Simulated annealing algorithm for the robust spanning tree problem
Ant colony optimization and the minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Algorithms for the minimum spanning tree problem with resource allocation
On the complexity of the bilevel minimum spanning tree problem
Bounded degree spanning trees
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Inferring phylogenetic trees under the general Markov model via a minimum spanning tree backbone
Contagion pattern identification through minimum spanning trees during the Asian financial crisis
Erweiterung des Spanning Tree Simulators