{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002811355,0.001835125,0.00172572,0.0009694005,0.0005453296,0.002344702,0.002013853,0.001935568,0.004870076],"category_scores_gemma":[0.01766042,0.0009219865,0.00203015,0.001033871,0.002327429,0.004217783,0.002907722,0.003300555,0.0006884538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002632042,"about_ca_system_score_gemma":0.0009722113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002362942,"about_ca_topic_score_gemma":0.001624351,"domain_scores_codex":[0.9968771,0.001034491,0.0001430419,0.0009021781,0.0007169242,0.0003262212],"domain_scores_gemma":[0.9911997,0.006307193,0.0007224804,0.001129635,0.0004599742,0.0001810304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001010791,0.00003205634,0.0004520731,0.0001668151,0.00004792077,0.00006144528,0.0000796743,0.8994971,0.0008798261,0.08245783,0.0009085837,0.01531569],"study_design_scores_gemma":[0.00001420279,0.00002961153,0.00005545255,0.00001626336,0.00001001954,0.00002598429,0.00001454569,0.8978336,0.0004199473,0.1005025,0.00107068,0.00000726077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02137396,0.0006307032,0.9701971,0.0004873874,0.00005474606,0.00005409804,0.0002095068,0.0003662801,0.006626287],"genre_scores_gemma":[0.6853712,0.001306306,0.3048301,0.0003102228,0.0001921577,0.0003090911,0.0008052803,0.0003071983,0.006568384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004870076,"threshold_uncertainty_score":0.01909685,"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."}}