- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Better Hardness Results for the Minimum Spanning Tree Congestion Problem ; day:26 ; month:10 ; year:2024 ; pages:1-18
Algorithmica ; (26.10.2024), 1-18
- Urheber
-
Luu, Huong
Chrobak, Marek
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-024-01278-5
- URN
-
urn:nbn:de:101:1-2501162117264.508949972967
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 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
- Luu, Huong
- Chrobak, Marek
- SpringerLink (Online service)
Ähnliche Objekte (12)
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
Hardness and approximation of submodular minimum linear ordering problems
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Clustering with Minimum Spanning Trees: How Good Can It Be?
On the complexity of the bilevel minimum spanning tree problem
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
Hardness and approximation of submodular minimum linear ordering problems
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Clustering with Minimum Spanning Trees: How Good Can It Be?
On the complexity of the bilevel minimum spanning tree problem
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
Hardness and approximation of submodular minimum linear ordering problems
Minimum Spanning Trees Made Easier Via Multi-Objective Optimization
Ant colony optimization and the minimum spanning tree problem
A Stronger Lower Bound on Parametric Minimum Spanning Trees
Algorithms for the minimum spanning tree problem with resource allocation
A greedy heuristic for the capacitated minimum spanning tree problem
Clustering with Minimum Spanning Trees: How Good Can It Be?