{"id":"W49447563","doi":"10.1007/978-3-642-32241-9_1","title":"A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Regret; Minimax; Computer science; Tree (set theory); Algorithm; Time complexity; Mathematical optimization; Mathematics; Combinatorics; Machine learning","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.002073327,0.002185583,0.003332775,0.001688079,0.001659375,0.003822353,0.004170369,0.002824271,0.01981203],"category_scores_gemma":[0.007224879,0.001140987,0.002409849,0.003284208,0.00112878,0.004549285,0.002754981,0.003769317,0.004683018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003795932,"about_ca_system_score_gemma":0.004139773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007562475,"about_ca_topic_score_gemma":0.01556455,"domain_scores_codex":[0.9981456,0.0003252344,0.0001189506,0.0005597497,0.0004613943,0.0003890435],"domain_scores_gemma":[0.9972883,0.001575236,0.0001652718,0.0004159213,0.000359053,0.0001962711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001193187,0.0006119885,0.001735221,0.0005871931,0.0002208601,0.0001297679,0.0002834202,0.4468504,0.005966167,0.03275023,0.0441553,0.4655163],"study_design_scores_gemma":[0.0001875388,0.0001307089,0.0004675323,0.00003908374,0.00004784189,0.00007524232,0.00009988972,0.9330658,0.001751277,0.0604717,0.003635982,0.00002729042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02921458,0.001036435,0.9501595,0.001107331,0.0003448359,0.0004179988,0.001672092,0.006817307,0.00922994],"genre_scores_gemma":[0.1082057,0.0002643498,0.8797273,0.000369525,0.0001923415,0.0005168063,0.002795628,0.0008380221,0.007090286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01981203,"threshold_uncertainty_score":0.0662778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02601981252845387,"score_gpt":0.2422616247023887,"score_spread":0.2162418121739348,"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."}}