{"id":"W2952752670","doi":"10.48550/arxiv.1605.03203","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Rounding; Combinatorics; Spanning tree; Degree (music); Approximation algorithm; Constant (computer programming); Mathematical optimization; Minimum spanning tree; Reduction (mathematics); Lagrangian relaxation; Discrete mathematics; Computer science","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.001046085,0.001389217,0.001107245,0.0005992125,0.0004747353,0.001084969,0.002392541,0.001163333,0.005407479],"category_scores_gemma":[0.004589814,0.0007431103,0.0009544134,0.001577389,0.0007931462,0.00305947,0.001877453,0.002024668,0.000917442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00112504,"about_ca_system_score_gemma":0.0009597309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003302887,"about_ca_topic_score_gemma":0.003564077,"domain_scores_codex":[0.9990023,0.0002782253,0.00004130118,0.000235957,0.0002875287,0.0001547317],"domain_scores_gemma":[0.9985102,0.0008368454,0.000150168,0.0002510455,0.0001620352,0.0000896781],"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.0001427239,0.000163579,0.0005849657,0.0002928771,0.00005572554,0.0001331062,0.0001287214,0.8517334,0.003489386,0.05110597,0.00514683,0.08702279],"study_design_scores_gemma":[0.00001670045,0.00003687637,0.0001014533,0.00001850593,0.00001100378,0.00004452791,0.00002770582,0.9633297,0.001007122,0.03364559,0.001754763,0.000006100164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03892685,0.0004529795,0.9540815,0.0003719926,0.0000574415,0.0001172166,0.0002189945,0.0003207843,0.005452344],"genre_scores_gemma":[0.323373,0.0006808617,0.667874,0.0002651264,0.0001095971,0.0003009504,0.0007855822,0.0004789652,0.006131877],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005407479,"threshold_uncertainty_score":0.01808983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06834909232928307,"score_gpt":0.2194286375278627,"score_spread":0.1510795451985796,"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."}}