{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003660218,0.00008407538,0.0001099578,0.0000384597,0.0002044028,0.0000524563,0.000566182,0.00002977384,0.000008756741],"category_scores_gemma":[0.0007070454,0.00003320683,0.0000908251,0.000293748,0.0002640064,0.00008265448,0.0001792239,0.00006170644,0.000003881391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006647716,"about_ca_system_score_gemma":0.00001266901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001197084,"about_ca_topic_score_gemma":0.000002891114,"domain_scores_codex":[0.9992052,0.00005522332,0.0001872205,0.0001761232,0.0002004643,0.0001757468],"domain_scores_gemma":[0.9975027,0.001848938,0.00008647915,0.0004728785,0.00005576677,0.00003323121],"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.000001646504,0.0000495984,0.00002899695,0.00002564837,0.000008728955,1.184815e-7,0.0001437633,2.511745e-7,0.0004623651,0.8711407,0.00006023106,0.1280779],"study_design_scores_gemma":[0.000241198,0.0001218639,0.000453257,0.0002597849,0.00001394533,0.000006755899,0.00002978499,0.01072837,0.002158633,0.9844531,0.001429967,0.0001033693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05183529,0.0000453313,0.9343358,0.01211943,0.0001044066,0.0006844599,0.000003638722,0.0001033822,0.0007682574],"genre_scores_gemma":[0.9222487,0.00000370302,0.07730058,0.00009614589,0.00001808576,0.0001101357,9.208489e-8,0.000006676763,0.0002158691],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8704134,"threshold_uncertainty_score":0.1572122,"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."}}