{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008304145,0.001931203,0.00257626,0.001907221,0.001287255,0.002324644,0.004845005,0.002176379,0.0146712],"category_scores_gemma":[0.004925338,0.0008834107,0.001668932,0.004184213,0.000765915,0.004778314,0.002605757,0.002416938,0.002473551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002389302,"about_ca_system_score_gemma":0.002149582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004533912,"about_ca_topic_score_gemma":0.007155559,"domain_scores_codex":[0.9988275,0.0001845714,0.00007597272,0.0002879275,0.0004215081,0.0002025586],"domain_scores_gemma":[0.9976539,0.001058158,0.0001352849,0.0006311652,0.0003613468,0.0001601848],"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.00173502,0.0009633271,0.002295765,0.0009446118,0.0001793385,0.0003033805,0.0004758149,0.2379635,0.01557637,0.04238463,0.03808754,0.6590906],"study_design_scores_gemma":[0.000332159,0.0002039532,0.0008250272,0.00004610874,0.0001171226,0.0003810838,0.000155872,0.9547425,0.004246755,0.03246377,0.006449239,0.00003640433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1094942,0.001446,0.8590748,0.001617352,0.0004653544,0.000657699,0.001582329,0.005512489,0.02014986],"genre_scores_gemma":[0.2250105,0.0005118346,0.763646,0.0003502094,0.000217411,0.0005532059,0.00279597,0.0004540985,0.006460651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0146712,"threshold_uncertainty_score":0.04908007,"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."}}