{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":17,"of":17,"of_with_code":8,"tagged_in_all":17,"counts":{"archive_papers_tagged":17,"with_a_code_link":8,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":17,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/approximation-algorithms-for-combinatorial","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/approximation-algorithms-for-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2411.16600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.16600"}},"official":{"repos":["adampolak/steiner-tree-with-predictions"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/query-decision-regression-between-shortest","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"url":null,"slug":"learning-to-prune-instances-of-steiner-tree","title":"Learning to Prune Instances of Steiner Tree Problem in Graphs","date":"2022-08-25","arxiv_id":"2208.11985","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-connection-search-in-graph","title":"Integrating connection search in graph queries","date":"2022-08-09","arxiv_id":"2208.04802","repositories_listed":0,"syntology":null},{"url":null,"slug":"submarine-cable-network-design-for-regional","title":"Submarine Cable Network Design for Regional Connectivity","date":"2022-01-15","arxiv_id":"2201.05802","repositories_listed":0,"syntology":null},{"url":null,"slug":"vulcan-solving-the-steiner-tree-problem-with","title":"Vulcan: Solving the Steiner Tree Problem with Graph Neural Networks and Deep Reinforcement Learning","date":"2021-11-21","arxiv_id":"2111.10810","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-large-steiner-tree-problems-in-graphs","title":"Solving Large Steiner Tree Problems in Graphs for Cost-Efficient Fiber-To-The-Home Network Expansion","date":"2021-09-22","arxiv_id":"2109.10617","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-steiner-trees-using-graph-neural","title":"Computing Steiner Trees using Graph Neural Networks","date":"2021-08-18","arxiv_id":"2108.08368","repositories_listed":0,"syntology":null},{"url":null,"slug":"devolutionary-genetic-algorithms-with","title":"Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem","date":"2020-04-18","arxiv_id":"2004.10048","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-framework-for-two-stage","title":"Evolutionary framework for two-stage stochastic resource allocation problems","date":"2018-11-29","arxiv_id":"1903.01885","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-steiner-tree-problem-in-graphs","title":"Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent","date":"2018-06-13","arxiv_id":"1806.06685","repositories_listed":0,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/task/steiner-tree-problem/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/steiner-tree-problem/papers/ran/1","json":"/task/steiner-tree-problem/papers/ran/1.json","rows":1}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"4751fe89ff5514c6e2e36360983037d2b197b591796bec8797f76c4b95d146e5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}