{"id":"W974563791","doi":"10.1016/j.jda.2015.05.013","title":"On the hardness of full Steiner tree problems","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Gomory–Hu tree; Vertex (graph theory); K-ary tree; Tree (set theory); Time complexity; Approximation algorithm; Discrete mathematics; Bottleneck; Graph; Tree structure; Binary tree; Computer science","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.004651864,0.001786296,0.003950882,0.003049442,0.003211335,0.00656317,0.006129212,0.004195352,0.02242859],"category_scores_gemma":[0.04259088,0.002067224,0.002770265,0.005081838,0.007113402,0.02303233,0.007519404,0.01129152,0.001926948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0036588,"about_ca_system_score_gemma":0.002565617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003494598,"about_ca_topic_score_gemma":0.002984171,"domain_scores_codex":[0.9946004,0.001840796,0.0002447343,0.0009006991,0.001400015,0.001013402],"domain_scores_gemma":[0.9281379,0.06317484,0.001878032,0.003227679,0.001559705,0.002021757],"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.002226375,0.000607095,0.003590796,0.001441101,0.0002849317,0.0003969289,0.001290839,0.1317289,0.002090627,0.7227032,0.06725062,0.06638872],"study_design_scores_gemma":[0.0001809836,0.0000604351,0.0007554166,0.00009239956,0.00005169791,0.0001531531,0.0002694789,0.07906499,0.0003397755,0.9142644,0.004736882,0.00003041405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3754695,0.01593267,0.3073421,0.0659053,0.001738056,0.0003868017,0.006167439,0.001595076,0.2254631],"genre_scores_gemma":[0.90221,0.008652661,0.05222139,0.004328086,0.003389779,0.0004134484,0.004109873,0.000858689,0.02381608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02242859,"threshold_uncertainty_score":0.07503116,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05273686323686087,"score_gpt":0.2655842799530101,"score_spread":0.2128474167161492,"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."}}