{"id":"W2001915330","doi":"10.1007/s00453-013-9851-7","title":"A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Theory of computation; Minimax; Computer science; Algorithm; Tree (set theory); Time complexity; Mathematical optimization; Mathematics; Combinatorics","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":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000389814,0.0002786556,0.0002827262,0.00017802,0.0003085805,0.0001952019,0.0003604167,0.00009425226,0.001343476],"category_scores_gemma":[0.00008417384,0.0002637194,0.0001602248,0.0004808668,0.00005221491,0.0004616165,0.0001547697,0.0001380464,0.00900175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004268918,"about_ca_system_score_gemma":0.00001539819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006637775,"about_ca_topic_score_gemma":0.0000469308,"domain_scores_codex":[0.9981832,0.00001360177,0.0004246796,0.000479408,0.0002973271,0.0006017923],"domain_scores_gemma":[0.9991481,0.00006744893,0.0001106705,0.0003967286,0.0002370952,0.00003990202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009221429,0.0001024264,0.00003501457,0.00005850935,0.00005523412,0.000001967765,0.00003259984,0.0008437407,0.00001248496,0.001308648,0.2902464,0.7072937],"study_design_scores_gemma":[0.0005231057,0.00003174961,0.0006056129,0.00003649864,0.00003227957,4.101511e-7,0.00005789165,0.7640406,0.00001076061,0.001653113,0.2327329,0.0002750626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04442767,0.0003724856,0.7034242,0.06541374,0.01174347,0.01363956,0.0001038242,0.003496793,0.1573783],"genre_scores_gemma":[0.2266187,0.00004770769,0.558839,0.07437677,0.05996164,0.001973731,0.003345454,0.0006299562,0.07420713],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7631969,"threshold_uncertainty_score":0.9999815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01579945048592608,"score_gpt":0.221848114930954,"score_spread":0.2060486644450279,"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."}}