{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","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.0005632612,0.0008089303,0.0008137709,0.001143854,0.0004850902,0.0006702959,0.001735219,0.001115839,0.003166605],"category_scores_gemma":[0.003367677,0.0005987929,0.0009347826,0.002065916,0.0006381542,0.001989104,0.0009102178,0.000609205,0.000697212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214118,"about_ca_system_score_gemma":0.00124168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006139442,"about_ca_topic_score_gemma":0.007372767,"domain_scores_codex":[0.9994699,0.0001234171,0.00002485965,0.0001473055,0.0001074061,0.0001270486],"domain_scores_gemma":[0.9987923,0.0006750468,0.0001779894,0.000172791,0.0001025153,0.00007929614],"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.0003179778,0.000166613,0.002218571,0.0002391765,0.00006960978,0.0002556791,0.000125265,0.8513169,0.008531609,0.01900963,0.007163382,0.1105857],"study_design_scores_gemma":[0.00003461869,0.00004008599,0.0003590115,0.00001242532,0.00001265271,0.00009053579,0.00005482639,0.9785783,0.002133833,0.01760536,0.00107175,0.000006639117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1532371,0.0003918282,0.8361926,0.0004075152,0.00004074414,0.0002525224,0.0005661656,0.002027443,0.006884024],"genre_scores_gemma":[0.4596653,0.000184277,0.5355815,0.0001218639,0.00002421033,0.0001768097,0.00128204,0.0002804186,0.002683553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006139442,"threshold_uncertainty_score":0.01220739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01281695513791297,"score_gpt":0.241961675845559,"score_spread":0.229144720707646,"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."}}