graphs-2
Steiner Tree Problem
3260 papers • 126 benchmarks • 313 datasets
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.
(Image credit: Papersgraph)
Benchmarks
These leaderboards are used to track progress in steiner-tree-problem-2
Trend
Dataset
Best Model
Actions
No benchmarks available.
Libraries
iUse these libraries to find steiner-tree-problem-2 models and implementations
Datasets
Subtasks
No subtasks available.
Most implemented papers
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
J. Fichte, Markus Hecher, Michael Morak, S. Woltran•Tue Jun 27 2017
This paper considers finding one solution to instances of answer set programming (ASP), which is a logic-based declarative modeling and solving framework, and describes the underlying concepts of the implementation, which is based on a novel approach that is called multi-pass dynamic programming (M-DPSINC).
16