{"id":"W2979731478","doi":"10.1145/3341599","title":"A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Multigraph; Mathematics; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Vertex connectivity; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Reduction (mathematics); Vertex cover; Discrete mathematics; Algorithm; Computer science; Graph; Line graph; Vertex (graph theory); Artificial intelligence","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.0009181083,0.001928521,0.001520031,0.001389465,0.0009309235,0.001658337,0.002718502,0.002199435,0.009850191],"category_scores_gemma":[0.004515752,0.000739165,0.001717895,0.002482859,0.0007926958,0.003775101,0.002258896,0.00313257,0.003583488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002347135,"about_ca_system_score_gemma":0.002738597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004735387,"about_ca_topic_score_gemma":0.006432056,"domain_scores_codex":[0.9985889,0.0002290434,0.00008878329,0.0003562016,0.0004232771,0.0003137224],"domain_scores_gemma":[0.9985737,0.0005916072,0.0001243393,0.000425981,0.0001722094,0.0001120798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001602165,0.0009180702,0.001664912,0.0006625517,0.0002209219,0.0004265341,0.0004520268,0.2857719,0.02003506,0.06566691,0.06088966,0.5616892],"study_design_scores_gemma":[0.0003916728,0.0002720875,0.0006653413,0.00006280636,0.00008376214,0.0006052711,0.0001657768,0.8789139,0.007832309,0.09474818,0.01620807,0.00005088067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03363875,0.0008139488,0.9476537,0.001311454,0.0002642064,0.0003783236,0.0007356115,0.004400485,0.01080343],"genre_scores_gemma":[0.1265889,0.000370231,0.8650979,0.0004548333,0.0001097525,0.0004551156,0.002080084,0.0005007941,0.004342412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009850191,"threshold_uncertainty_score":0.03295219,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02408591830526699,"score_gpt":0.2552901439520244,"score_spread":0.2312042256467574,"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."}}