{"id":"W2132064078","doi":"10.1287/moor.2013.0620","title":"Approximability of Robust Network Design","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Steiner tree problem; Network planning and design; Polytope; Approximation algorithm; Robustness (evolution); Combinatorics; Mathematical optimization; Reduction (mathematics); Generalization; Discrete mathematics; Regular polygon; Convex polytope; Convex optimization; Computer science; Convex set","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":[],"consensus_categories":[],"category_scores_codex":[0.002844084,0.00007740418,0.0001995919,0.000130369,0.0002674414,0.0001366873,0.001305989,0.0000431826,0.0002088056],"category_scores_gemma":[0.000595985,0.00006530146,0.00004357085,0.001038898,0.0002054103,0.000378839,0.0005978667,0.0002075588,0.00005837033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003072599,"about_ca_system_score_gemma":0.000152243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002267272,"about_ca_topic_score_gemma":0.00001371424,"domain_scores_codex":[0.9981783,0.0005083146,0.0004535766,0.000173446,0.0004481485,0.0002381966],"domain_scores_gemma":[0.9964067,0.0007916619,0.00004375183,0.001215283,0.001480524,0.00006211852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001754111,0.0005618198,0.00006589479,0.0001004007,0.00002823422,2.186958e-7,0.003172112,0.2030803,0.006802167,0.7698559,0.004721148,0.01161005],"study_design_scores_gemma":[0.0001055754,0.00007182695,0.0001827718,0.00005402368,0.000001390743,0.000001245331,0.0001162284,0.982056,0.004389037,0.01287527,0.00007929499,0.00006731947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01129507,0.0002139339,0.9829191,0.0007991864,0.00002514908,0.0007477143,6.247728e-7,0.00002718755,0.003972059],"genre_scores_gemma":[0.4355773,0.00008979936,0.5639044,0.000008687676,0.0000132874,0.0001000703,0.00000103386,0.000004777941,0.0003006624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7789757,"threshold_uncertainty_score":0.2662916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2796842248226325,"score_gpt":0.387521989843839,"score_spread":0.1078377650212065,"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."}}