SOTAVerified

Steiner Tree Problem

The Steiner tree problem is a computational problem in computer science and graph theory that involves finding the minimum weight subgraph in an undirected graph that connects a given set of terminal vertices. The goal of the Steiner tree problem is to minimize the total weight of the edges in the subgraph, and it is considered NP-hard, meaning that finding the optimal solution is computationally difficult.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 11–17 of 17 papers

TitleStatusHype
Computing Steiner Trees using Graph Neural Networks—0
Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem—0
Evolutionary framework for two-stage stochastic resource allocation problems—0
Integrating connection search in graph queries—0
Learning to Prune Instances of Steiner Tree Problem in Graphs—0
Solving Large Steiner Tree Problems in Graphs for Cost-Efficient Fiber-To-The-Home Network Expansion—0
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent—0
Show:102550
← PrevPage 2 of 2Next →

No leaderboard results yet.