Parallel Greedy Algorithms for Steiner Forest

The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with non-negative weights for edges and a set of pairs of vertices called terminals, the Steiner Forest Problem is to find the minimum cost subgraph t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 36; H. 6; S. 1311 - 1325
Hauptverfasser:	Ghalami, Laleh, Grosu, Daniel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2025
Schlagworte:	Approximation algorithms Costs Forestry Greedy algorithms Libraries multi-core Optimization Parallel algorithms Partitioning algorithms Steiner forest Steiner trees Training
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!