{"id":"W2607867111","doi":"10.1007/s10107-017-1150-7","title":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Matroid; Mathematics; Spanning tree; Combinatorics; Degree (music); Approximation algorithm; Mathematical optimization; Minimum spanning tree; Linear programming relaxation; Reduction (mathematics); Constant (computer programming); Submodular set function; Lagrangian relaxation; Discrete mathematics; Linear programming; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008226763,0.0003558399,0.0005056498,0.0001842379,0.001261314,0.001743824,0.001835801,0.0001349385,0.00005086345],"category_scores_gemma":[0.0004617436,0.0003185652,0.0001847231,0.0003940182,0.0002510618,0.0007349997,0.0007439051,0.0003547048,0.0001203498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006922591,"about_ca_system_score_gemma":0.00004829533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008475683,"about_ca_topic_score_gemma":0.00001354412,"domain_scores_codex":[0.997063,0.00007730083,0.0007146176,0.000833649,0.000540451,0.0007710275],"domain_scores_gemma":[0.9974173,0.0002023566,0.0003996637,0.001518018,0.0001213236,0.0003413197],"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.000009735445,0.0003516287,0.0000612426,0.000132806,0.00008189816,0.00003364101,0.006703601,0.00002686537,0.001604633,0.1363101,0.00005842494,0.8546255],"study_design_scores_gemma":[0.0008191041,0.0001690362,0.0001849394,0.0009360425,0.00003989661,0.00007947843,0.000577175,0.7105781,0.002013507,0.2802514,0.003596389,0.0007548704],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02386702,0.00004157778,0.968412,0.001832659,0.000350959,0.001360612,0.000005770078,0.0006330786,0.003496257],"genre_scores_gemma":[0.2792127,8.212929e-7,0.7201294,0.00004336152,0.0002134605,0.0002413423,0.000008009367,0.00002481508,0.0001260468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8538706,"threshold_uncertainty_score":0.9999266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04325035615917717,"score_gpt":0.2848704777635555,"score_spread":0.2416201216043783,"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."}}