{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006215477,0.0001603693,0.0001190075,0.00006845911,0.0002825737,0.0001724755,0.0002749437,0.00006955156,0.0002621912],"category_scores_gemma":[0.00004161864,0.0001137496,0.00007957686,0.0002946092,0.0000349521,0.0002983637,0.00002585633,0.0001141907,0.00007068933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002138807,"about_ca_system_score_gemma":0.00001002345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002579614,"about_ca_topic_score_gemma":0.001259738,"domain_scores_codex":[0.9989976,0.00001466087,0.0002206446,0.0002881047,0.0001537606,0.0003251746],"domain_scores_gemma":[0.9993726,0.0000373021,0.00006083142,0.0004137539,0.00009734237,0.00001819784],"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.00003164591,0.0001584682,0.0001558801,0.00004738367,0.00005190085,8.257062e-7,0.00005887133,0.01284412,0.000006001111,0.02656621,0.07050837,0.8895703],"study_design_scores_gemma":[0.0003455709,0.00002416205,0.00027924,0.00000797445,0.00003117694,9.900384e-8,0.0001431907,0.6400069,0.000002664187,0.0009526639,0.3580868,0.0001195139],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00238711,0.0004996809,0.8811578,0.01202408,0.005545205,0.004968132,0.00001021004,0.0005875255,0.09282024],"genre_scores_gemma":[0.9531609,0.0001204836,0.01202737,0.01992789,0.005292874,0.00130533,0.0002921655,0.0001115595,0.007761423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9507738,"threshold_uncertainty_score":0.4638574,"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."}}