{"id":"W1093958314","doi":"10.1016/j.tcs.2015.07.009","title":"Improved algorithms for computing minmax regret sinks on dynamic path and tree networks","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Minimax; Sink (geography); Vertex (graph theory); Computer science; Algorithm; Path (computing); Time complexity; Mathematical optimization; Mathematics; Graph; Combinatorics; Theoretical computer science; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.00131126,0.0001707469,0.0001683865,0.000149473,0.0003183911,0.0004011687,0.0004694359,0.00004422609,0.00001370152],"category_scores_gemma":[0.0001293616,0.000141101,0.00004210685,0.0004911694,0.0008108448,0.0003994292,0.0004529447,0.0001085924,0.00002521471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000446114,"about_ca_system_score_gemma":0.00002101296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002864215,"about_ca_topic_score_gemma":0.000008625942,"domain_scores_codex":[0.99848,0.00001334486,0.0002415276,0.00051993,0.0003185385,0.0004266901],"domain_scores_gemma":[0.9992888,0.00005177414,0.00005284307,0.0003085957,0.0002339947,0.00006396716],"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.0000545976,0.0000730078,0.00007995714,0.00004370214,0.000006222013,0.000001514196,0.00009789853,0.005032114,0.00001693673,0.7642075,0.0007023531,0.2296842],"study_design_scores_gemma":[0.0004685615,0.00008941921,0.0007869564,0.00002557353,0.00001205694,7.910633e-7,0.00004164638,0.9801331,0.000005196855,0.01706312,0.001183087,0.000190505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04893066,0.00002224444,0.9446347,0.001661806,0.00113602,0.0004330709,0.000001231924,0.00014168,0.003038579],"genre_scores_gemma":[0.983785,0.000002202824,0.01350617,0.002247577,0.0003971973,0.000008059496,0.00000942151,0.00001073181,0.0000335782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975101,"threshold_uncertainty_score":0.5753933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02397579674805962,"score_gpt":0.2565413473620907,"score_spread":0.2325655506140311,"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."}}