{"id":"W2036569687","doi":"10.5555/1283383.1283507","title":"An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem","year":2007,"lang":"en","type":"article","venue":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Path (computing); Terminal (telecommunication); Graph; Connection (principal bundle); Connectivity; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Set (abstract data type); Discrete mathematics; Computer network; Telecommunications","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.004116958,0.001003231,0.00151905,0.0008639016,0.00128486,0.001699133,0.003858277,0.001729855,0.004238859],"category_scores_gemma":[0.005586379,0.0006365248,0.001005313,0.001801639,0.0009492122,0.004196029,0.002300474,0.001214837,0.0004394356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001649673,"about_ca_system_score_gemma":0.001902575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230128,"about_ca_topic_score_gemma":0.001287032,"domain_scores_codex":[0.997326,0.001023912,0.0001718624,0.0004317441,0.0005772632,0.0004691815],"domain_scores_gemma":[0.9975005,0.000912555,0.0004237656,0.0006481558,0.0001856117,0.0003293445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001734028,0.0008379874,0.002015427,0.0005032607,0.0002396611,0.0004368924,0.0005946152,0.4804042,0.01237334,0.3056619,0.01110107,0.1840975],"study_design_scores_gemma":[0.0003089893,0.0003735851,0.0005505354,0.0000350006,0.00006108564,0.0004048517,0.0001386651,0.839356,0.003047606,0.1487338,0.006926975,0.00006291331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1608173,0.0003306904,0.8282422,0.0007061191,0.00008942963,0.0006297902,0.0004417684,0.0009788852,0.007763859],"genre_scores_gemma":[0.7893947,0.0001784932,0.2060314,0.0001202192,0.00004191387,0.0004364345,0.0002900963,0.00008387592,0.003423022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004238859,"threshold_uncertainty_score":0.0217728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.103616335557666,"score_gpt":0.3297581427751367,"score_spread":0.2261418072174707,"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."}}