{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001759232,0.003733795,0.003846665,0.002222916,0.001522993,0.003797238,0.007384757,0.003631664,0.02348296],"category_scores_gemma":[0.01265361,0.001451806,0.002853373,0.006524823,0.001754124,0.008728427,0.004108162,0.004167554,0.005701521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005213798,"about_ca_system_score_gemma":0.003815779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006848586,"about_ca_topic_score_gemma":0.009749984,"domain_scores_codex":[0.9974352,0.0004957211,0.0001153832,0.0007433828,0.0007864678,0.0004239488],"domain_scores_gemma":[0.9941044,0.00305206,0.0004056082,0.00154929,0.0004372124,0.0004514172],"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.004087763,0.001676694,0.003226466,0.002708789,0.0004685434,0.0004231615,0.0009274718,0.3170564,0.02057897,0.1083911,0.102579,0.4378756],"study_design_scores_gemma":[0.0007153144,0.0003353283,0.001404589,0.0001614132,0.0003000165,0.0006658097,0.0003831273,0.7480727,0.006262299,0.2310741,0.01054987,0.00007537127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.208232,0.003630766,0.7095467,0.006777596,0.0007413161,0.001113098,0.006643191,0.01185723,0.05145815],"genre_scores_gemma":[0.3848391,0.001411178,0.5856543,0.001238363,0.0004968515,0.0009349459,0.006964991,0.002044611,0.01641567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02348296,"threshold_uncertainty_score":0.07855827,"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."}}