{"id":"W2017571998","doi":"10.1002/net.10062","title":"An improved algorithm for the minmax regret median problem on a tree","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Minimax; Tree (set theory); Node (physics); Mathematical optimization; Mathematics; Algorithm; Function (biology); Interval (graph theory); Computer science; Combinatorics; Statistics","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.001329803,0.0009127642,0.001848844,0.001073057,0.00082956,0.001627598,0.002052719,0.001902359,0.008636365],"category_scores_gemma":[0.003618411,0.0004867407,0.000952214,0.001699587,0.0004987911,0.002744405,0.002257032,0.001590172,0.001845644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001390102,"about_ca_system_score_gemma":0.001718651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003490743,"about_ca_topic_score_gemma":0.003933539,"domain_scores_codex":[0.9989893,0.0002526472,0.0000570983,0.0002512469,0.0002422535,0.0002075557],"domain_scores_gemma":[0.9990137,0.0004830183,0.0001055339,0.0001551623,0.000161455,0.00008109646],"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.0005322833,0.0002203522,0.0009966798,0.0002031953,0.00008315536,0.000168982,0.0002340102,0.5805004,0.003901056,0.03596112,0.01389741,0.3633014],"study_design_scores_gemma":[0.00008796723,0.00005666293,0.0001506748,0.0000157409,0.00001287807,0.00006294515,0.00003978254,0.9628171,0.0007973432,0.03267144,0.003275792,0.00001171387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01482609,0.0002671391,0.9798854,0.0003004772,0.00006586183,0.00009395278,0.0002078629,0.001345758,0.003007484],"genre_scores_gemma":[0.1244076,0.0001846813,0.8706115,0.0001302498,0.00009992371,0.0002682411,0.0006618842,0.0002386648,0.003397127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008636365,"threshold_uncertainty_score":0.0288915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01936179780754634,"score_gpt":0.2328850661918709,"score_spread":0.2135232683843246,"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."}}