{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002434765,0.00200571,0.003016255,0.001777918,0.001661333,0.003583703,0.004484311,0.002864421,0.01412944],"category_scores_gemma":[0.008118475,0.001079274,0.00176753,0.002816957,0.0014604,0.004569144,0.003095037,0.003373963,0.002459313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004226078,"about_ca_system_score_gemma":0.0046937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01021525,"about_ca_topic_score_gemma":0.01979251,"domain_scores_codex":[0.9982464,0.0004176435,0.00009266661,0.0004856685,0.0003757319,0.0003818532],"domain_scores_gemma":[0.9964457,0.002281437,0.0002405476,0.0004181592,0.0003545538,0.0002596293],"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.0008217529,0.0004147303,0.001407126,0.0003263424,0.000131906,0.00009984407,0.0001938188,0.7706088,0.002719103,0.02855216,0.01760959,0.1771148],"study_design_scores_gemma":[0.00007571599,0.00005696917,0.000182652,0.00001322761,0.00001996705,0.0000275336,0.00004575894,0.9680319,0.0005580376,0.03012605,0.0008505216,0.00001160134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03493766,0.0005917479,0.9527022,0.001120677,0.0001837043,0.0003026815,0.0008837688,0.003287935,0.005989537],"genre_scores_gemma":[0.2057633,0.000258794,0.783366,0.0003890891,0.000172344,0.0005516608,0.001814522,0.0005456379,0.007138571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01412944,"threshold_uncertainty_score":0.04726768,"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."}}