{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312691,0.002160592,0.003034191,0.001559348,0.000925605,0.003066339,0.005333189,0.003057488,0.008713106],"category_scores_gemma":[0.01686097,0.001553553,0.00198531,0.004517989,0.001412268,0.007029104,0.003560629,0.004656842,0.001178339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002225262,"about_ca_system_score_gemma":0.001965079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00435293,"about_ca_topic_score_gemma":0.005209546,"domain_scores_codex":[0.9978249,0.0007184389,0.0001073016,0.0005763635,0.0005345764,0.0002384734],"domain_scores_gemma":[0.9907932,0.006863929,0.0005166964,0.0008838985,0.000572014,0.0003701991],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000266546,0.000416417,0.0008669155,0.0007869119,0.0001295438,0.0001565957,0.0002462079,0.7586882,0.001755785,0.09075318,0.0126502,0.1332835],"study_design_scores_gemma":[0.00002662738,0.0000351904,0.0001103136,0.00003196118,0.00003018921,0.00005214352,0.00004933894,0.8884052,0.0003896244,0.1094233,0.001436811,0.000009252308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02982616,0.0008683344,0.961979,0.0008322126,0.0001238605,0.0001910753,0.0004971563,0.0003706365,0.005311566],"genre_scores_gemma":[0.2731071,0.001447433,0.7116827,0.0005109069,0.000408447,0.000558512,0.001740954,0.0008587392,0.009685235],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008713106,"threshold_uncertainty_score":0.02914822,"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."}}