{"id":"W2369536682","doi":"10.1007/978-3-319-33461-5_4","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Rounding; Spanning tree; Degree (music); Approximation algorithm; Combinatorics; Minimum spanning tree; Mathematical optimization; Reduction (mathematics); Linear programming relaxation; Mathematics; Lagrangian relaxation; Computer science; Tree (set theory); Linear programming","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010965,0.0009121756,0.000912938,0.001606489,0.0006149642,0.0008829991,0.004181331,0.0004424191,0.00006251097],"category_scores_gemma":[0.000121344,0.0007718617,0.0002496994,0.001521861,0.0009082036,0.0008832536,0.001743705,0.0009718572,0.00008452161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004697051,"about_ca_system_score_gemma":0.0005464727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007442322,"about_ca_topic_score_gemma":0.00009354288,"domain_scores_codex":[0.9935329,0.0000791769,0.001073975,0.002791729,0.001326538,0.001195673],"domain_scores_gemma":[0.9960756,0.0006195503,0.0005795027,0.001935082,0.0003674241,0.0004228521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001038765,0.00004303599,0.00001248022,0.00002942692,0.0000332787,0.00005468727,0.002741841,0.003312626,0.001487878,0.02877275,0.00002358255,0.963478],"study_design_scores_gemma":[0.0005705131,0.000212708,0.00003737367,0.002019969,0.00001472838,0.0001083081,0.000001383926,0.6260992,0.00246045,0.3649451,0.002310445,0.001219849],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002293447,0.0002592577,0.9887648,0.001885196,0.002771644,0.00125518,0.00004260653,0.0004750143,0.004317012],"genre_scores_gemma":[0.03411813,0.00001942892,0.9630043,0.000725755,0.001445314,0.00007104754,0.00002250626,0.000068457,0.0005250401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9622582,"threshold_uncertainty_score":0.9994732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02235592030043055,"score_gpt":0.2387335166019005,"score_spread":0.21637759630147,"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."}}