{"id":"W2276707316","doi":"10.1007/s10107-016-0987-5","title":"On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Vertex (graph theory); Equivalence (formal languages); Bipartite graph; Upper and lower bounds; Relaxation (psychology); Linear programming; Graph; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005728962,0.001672437,0.002235712,0.001888044,0.001829409,0.005509203,0.004051418,0.002793965,0.01805716],"category_scores_gemma":[0.03029591,0.001445248,0.001824267,0.00344144,0.004744418,0.01442177,0.005531956,0.009832906,0.001266075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003142107,"about_ca_system_score_gemma":0.002221246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004179925,"about_ca_topic_score_gemma":0.004319542,"domain_scores_codex":[0.9972641,0.001381399,0.000122255,0.0003789935,0.0004898945,0.0003633611],"domain_scores_gemma":[0.9805015,0.01559813,0.001098686,0.0009693439,0.0007765297,0.001055706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001790826,0.0001737152,0.0004626596,0.0002373865,0.0000312249,0.00005588045,0.0004166203,0.03325034,0.000464872,0.9376494,0.007031484,0.02004741],"study_design_scores_gemma":[0.0000526875,0.00005334575,0.0003111071,0.00006674676,0.000020149,0.00004296855,0.0001696932,0.0923631,0.0001696723,0.9038903,0.002839249,0.00002092605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1770768,0.004865728,0.655162,0.01496417,0.0008103679,0.0003163463,0.001170281,0.0003546264,0.1452797],"genre_scores_gemma":[0.6979243,0.006732912,0.2497089,0.003748903,0.001789363,0.0007959595,0.002107867,0.0008952303,0.0362965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01805716,"threshold_uncertainty_score":0.06040722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03293364940603159,"score_gpt":0.2461192657988771,"score_spread":0.2131856163928456,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}