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

Full description

Bibliographic Details

Published in:	IEEE transactions on parallel and distributed systems Vol. 36; no. 6; pp. 1311 - 1325
Main Authors:	Ghalami, Laleh, Grosu, Daniel
Format:	Journal Article
Language:	English
Published:	IEEE 01.06.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!