{"url":"/task/steiner-tree-problem","name":"Steiner Tree Problem","slug":"steiner-tree-problem","description_markdown":"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.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":17,"papers_with_code":8,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/pace-2018-steiner-tree","name":"PACE 2018 Steiner Tree","full_name":"","num_papers_in_archive":4}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":8,"of":8,"tagged_in_all":17,"items":[{"url":"/paper/approximation-algorithms-for-combinatorial","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","date":"2024-11-25","arxiv_id":"2411.16600","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/query-decision-regression-between-shortest","title":"Query-decision Regression between Shortest Path and Minimum Steiner Tree","date":"2024-02-03","arxiv_id":"2402.02211","repositories_listed":1,"syntology":null},{"url":"/paper/neuroprim-an-attention-based-model-for","title":"NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems","date":"2022-10-22","arxiv_id":"2210.12453","repositories_listed":1,"syntology":null},{"url":"/paper/deep-steiner-learning-to-solve-the-euclidean","title":"Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem","date":"2022-09-20","arxiv_id":"2209.09983","repositories_listed":1,"syntology":null},{"url":"/paper/learning-augmented-algorithms-for-online","title":"Learning-Augmented Algorithms for Online Steiner Tree","date":"2021-12-10","arxiv_id":"2112.05353","repositories_listed":1,"syntology":null},{"url":"/paper/the-power-of-many-a-physarum-swarm-steiner","title":"The Power of Many: A Physarum Swarm Steiner Tree Algorithm","date":"2021-10-15","arxiv_id":"2110.08233","repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-steiner-tree-problem-with-few","title":"Solving the Steiner Tree Problem with few Terminals","date":"2020-11-09","arxiv_id":"2011.04593","repositories_listed":1,"syntology":null},{"url":"/paper/dynasp25-dynamic-programming-on-tree","title":"DynASP2.5: Dynamic Programming on Tree Decompositions in Action","date":"2017-06-28","arxiv_id":"1706.09370","repositories_listed":1,"syntology":null}],"syntology_records":1,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}