- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A Stronger Lower Bound on Parametric Minimum Spanning Trees ; day:22 ; month:8 ; year:2022 ; pages:1-16
Algorithmica ; (22.8.2022), 1-16
- Urheber
-
Eppstein, David
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-01024-9
- URN
-
urn:nbn:de:101:1-2022111021270155326681
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 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
- Eppstein, David
- SpringerLink (Online service)
Ähnliche Objekte (12)
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel
On the complexity of the bilevel minimum spanning tree problem
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel
On the complexity of the bilevel minimum spanning tree problem
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
The Quadratic Minimum Spanning Tree Problem: Lower Bounds via Extended Formulations
Weight-Constrained Minimum Spanning Tree Problem
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Engineering an external memory minimum spanning tree algorithm
The prize-collecting generalized minimum spanning tree problem
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel