{"id":"W1574619705","doi":"10.1007/978-3-540-85363-3_19","title":"A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Approximation algorithm; Mathematics; Vertex connectivity; Minimum spanning tree; Metric (unit); Graph; Steiner tree problem; Enhanced Data Rates for GSM Evolution; Constant (computer programming); Graph factorization; Discrete mathematics; Computer science; Line graph; Graph power","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.0004969947,0.0007614492,0.0008183363,0.002275839,0.0005737472,0.0006686659,0.003199748,0.000361336,0.00001411782],"category_scores_gemma":[0.000178249,0.0006416711,0.0002433909,0.002378032,0.001356981,0.000730958,0.0006746109,0.0007263251,0.00001191437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003892149,"about_ca_system_score_gemma":0.0008215436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002016837,"about_ca_topic_score_gemma":0.00007510115,"domain_scores_codex":[0.9951508,0.00004478846,0.0006741735,0.001981482,0.001236953,0.0009117897],"domain_scores_gemma":[0.9956356,0.001459317,0.0004983807,0.001474907,0.0006757037,0.0002560359],"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.00005552657,0.0001243645,0.00007344378,0.0001184289,0.00007191397,0.0001189001,0.001465248,0.002390144,0.0001325079,0.06434068,0.0001077591,0.9310011],"study_design_scores_gemma":[0.001786623,0.001200038,0.0002506787,0.0007301958,0.00003057186,0.0004634582,8.912104e-7,0.8757414,0.002322182,0.1118165,0.003710541,0.001946918],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002963712,0.0006622389,0.9941702,0.0003463293,0.001293758,0.001374921,0.00005406889,0.000311172,0.001490946],"genre_scores_gemma":[0.1226747,0.00010182,0.875739,0.0008289535,0.0003483177,0.00007193486,0.00002921827,0.00006085187,0.0001451725],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9290541,"threshold_uncertainty_score":0.9996035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02493618021603958,"score_gpt":0.2398673924388698,"score_spread":0.2149312122228303,"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."}}