{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001636367,0.0003994983,0.0004762037,0.0003030262,0.001617889,0.001022478,0.001673802,0.0001094133,0.0001969748],"category_scores_gemma":[0.0001312361,0.0003822527,0.000336904,0.001139807,0.00007941019,0.0006906153,0.0002560054,0.001323089,0.0001012411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008120844,"about_ca_system_score_gemma":0.00007141558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001658448,"about_ca_topic_score_gemma":0.000001437908,"domain_scores_codex":[0.996392,0.0003170835,0.000978716,0.0006235789,0.0007621436,0.0009264688],"domain_scores_gemma":[0.9974301,0.00108563,0.0004569923,0.0005731224,0.0001408579,0.000313255],"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.00003946189,0.0002493087,0.0004978272,0.00004783687,0.0001234353,0.0004534766,0.00541791,0.02081664,0.001811999,0.01544235,0.0004518763,0.9546479],"study_design_scores_gemma":[0.001695634,0.0004563457,0.0032649,0.001031216,0.00002308648,0.003502776,0.0003100953,0.896792,0.00112903,0.0877336,0.002892839,0.001168484],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4556739,0.0001898024,0.5347059,0.0006438525,0.001098573,0.0001398162,9.155126e-7,0.000441583,0.007105657],"genre_scores_gemma":[0.7538295,0.00001558204,0.2442344,0.001104935,0.0006951928,0.000001370797,9.57411e-7,0.0000296071,0.00008850313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9534794,"threshold_uncertainty_score":0.9998629,"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."}}