Steiner Tree Problem

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

1 dataset whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Most implemented papers archive 2025-07-28

8 shown of 8 papers with code (17 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

• Approximation Algorithms for Combinatorial Optimization with Predictions
  25 Nov 2024 1 repository listed Syntology ran 2 of 4 samples · 2 unverified · 4 pointer-only (licence)
  With small enough prediction error we achieve approximation guarantees that are beyond reach without predictions in the given time bounds, as exemplified by the NP-hardness and APX-hardness of many of the above problems.
• Query-decision Regression between Shortest Path and Minimum Steiner Tree
  3 Feb 2024 1 repository listed
  Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some subset of nodes?
• NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems
  22 Oct 2022 1 repository listed
  We apply our framework to three difficult problems on Euclidean space: the Degree-constrained Minimum Spanning Tree (DCMST) problem, the Minimum Routing Cost Spanning Tree (MRCST) problem, and the Steiner Tree Problem…
• Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem
  20 Sep 2022 1 repository listed
  The Euclidean Steiner tree problem seeks the min-cost network to connect a collection of target locations, and it underlies many applications of wireless networks.
• Learning-Augmented Algorithms for Online Steiner Tree
  10 Dec 2021 1 repository listed
  Steiner tree is known to have strong lower bounds in the online setting and any algorithm's worst-case guarantee is far from desirable.
• The Power of Many: A Physarum Swarm Steiner Tree Algorithm
  15 Oct 2021 1 repository listed
  We create a novel Physarum Steiner algorithm designed to solve the Euclidean Steiner tree problem.
• Solving the Steiner Tree Problem with few Terminals
  9 Nov 2020 1 repository listed
  We show that admissibility is indeed weaker than consistency and establish correctness of the DS* algorithm when using an admissible heuristic function.
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
  28 Jun 2017 1 repository listed
  In this paper, we describe underlying concepts of our new implementation (DynASP2.

Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.