{"id":"W46202281","doi":"10.1007/978-3-642-22006-7_2","title":"An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Approximation algorithm; Disjoint sets; Combinatorics; Vertex (graph theory); Steiner tree problem; Vertex connectivity; Graph; Mathematics; Computer science; Algorithm; Discrete mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001553941,0.0007264376,0.0007171832,0.0009610993,0.0005324445,0.0007469219,0.004542427,0.00046974,0.00002062157],"category_scores_gemma":[0.00007885341,0.0007124551,0.0002715657,0.0006584144,0.0007946939,0.001546137,0.0008542979,0.0007617358,0.00001592947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000250446,"about_ca_system_score_gemma":0.0005351973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005631997,"about_ca_topic_score_gemma":0.0001321137,"domain_scores_codex":[0.9953328,0.00005919623,0.0006373457,0.002320257,0.0007097209,0.0009406251],"domain_scores_gemma":[0.9960467,0.0005851456,0.0004371259,0.002172562,0.0004640124,0.0002944614],"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.000007255243,0.00008604571,0.00000521803,0.00003157696,0.00001285186,0.00001039041,0.0006568752,0.000459441,0.0001367619,0.02184617,0.00001025991,0.9767371],"study_design_scores_gemma":[0.0003350828,0.0003431625,0.00004816582,0.00008067766,0.000008819999,0.00003291417,1.779069e-7,0.6555316,0.001707033,0.340641,0.0006556327,0.0006157908],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004222419,0.0001378885,0.9944678,0.0001700204,0.002556128,0.001466156,0.00006892063,0.0003182451,0.0007726423],"genre_scores_gemma":[0.01597733,0.00001807081,0.9823392,0.0006392581,0.0007246491,0.00009894666,0.00004582062,0.00005236365,0.0001043322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9761214,"threshold_uncertainty_score":0.9995326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03058419392283176,"score_gpt":0.2600490150027649,"score_spread":0.2294648210799332,"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."}}