{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005002239,0.002604674,0.003413498,0.002917422,0.001601629,0.003151544,0.005642326,0.003124868,0.01056428],"category_scores_gemma":[0.02072953,0.00159901,0.001934284,0.003489826,0.002203198,0.005511662,0.003815114,0.00397068,0.001618263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004709535,"about_ca_system_score_gemma":0.004155257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01288172,"about_ca_topic_score_gemma":0.017414,"domain_scores_codex":[0.9979994,0.0006447351,0.0001110043,0.0004748659,0.0004237423,0.0003462847],"domain_scores_gemma":[0.9881706,0.009028407,0.000563802,0.0008228673,0.0009698826,0.0004444577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002170946,0.00009824754,0.0004900034,0.00009406261,0.00004172586,0.0000271321,0.00007382186,0.946283,0.0003886147,0.01389019,0.002509031,0.035887],"study_design_scores_gemma":[0.00001889959,0.00001633416,0.00005232108,0.000006422455,0.000007610215,0.000005749402,0.00001140247,0.9895977,0.0001273012,0.009982021,0.0001698443,0.00000427025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02661737,0.0004730105,0.9671199,0.0004803538,0.0001383941,0.0001974196,0.0004361901,0.001597803,0.002939538],"genre_scores_gemma":[0.247636,0.0003581124,0.7434168,0.0002701496,0.0001914566,0.0004811273,0.001238036,0.0006038499,0.00580448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01288172,"threshold_uncertainty_score":0.03534102,"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."}}