{"id":"W4253133138","doi":"10.1002/net.20106","title":"Variations of the prize‐collecting Steiner tree problem","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Steiner tree problem; Bottleneck; Combinatorics; Spanning tree; Mathematics; k-minimum spanning tree; Graph; Tree (set theory); Path (computing); Discrete mathematics; Time complexity; K-ary tree; Computer science; Tree structure; Binary tree","routes":{"ca_aff":true,"ca_fund":false,"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.001907552,0.0007410644,0.001131356,0.001065004,0.001416366,0.002236955,0.003499122,0.001603741,0.009961119],"category_scores_gemma":[0.004546876,0.0003992325,0.001672766,0.002813667,0.001114563,0.004550402,0.002523446,0.00219047,0.0007863948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330957,"about_ca_system_score_gemma":0.0009417798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001200143,"about_ca_topic_score_gemma":0.001139966,"domain_scores_codex":[0.9979963,0.0006032248,0.0001203592,0.0003876307,0.0005032291,0.000389189],"domain_scores_gemma":[0.9975532,0.0009852928,0.0003934744,0.0003997237,0.0002762582,0.0003920746],"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.0007923912,0.0005631755,0.002040854,0.0005313527,0.0002319311,0.0009068415,0.0003818056,0.2690594,0.00574828,0.5721875,0.03698075,0.1105758],"study_design_scores_gemma":[0.0001547725,0.0002955829,0.001572498,0.00006603748,0.0001019923,0.001965383,0.0003032557,0.41411,0.003068077,0.5355627,0.04271546,0.00008424827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2735175,0.00234663,0.6210214,0.002877801,0.0005094917,0.0005648548,0.001631114,0.0009579645,0.09657326],"genre_scores_gemma":[0.8705036,0.001416544,0.10808,0.0003209584,0.0003842431,0.0002941655,0.001183093,0.0001722568,0.01764511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009961119,"threshold_uncertainty_score":0.03332329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04312057372365112,"score_gpt":0.3182009348621068,"score_spread":0.2750803611384557,"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."}}