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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on parallel and distributed systems Ročník 36; číslo 6; s. 1311 - 1325
Hlavní autori:	Ghalami, Laleh, Grosu, Daniel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2025
Predmet:	Approximation algorithms Costs Forestry Greedy algorithms Libraries multi-core Optimization Parallel algorithms Partitioning algorithms Steiner forest Steiner trees Training
ISSN:	1045-9219, 1558-2183
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!