{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000973439,0.0004499663,0.0004124949,0.0008573569,0.0002874018,0.0002574228,0.0009188112,0.0001976834,0.00022517],"category_scores_gemma":[0.0001053744,0.0004161094,0.0001591039,0.0003967453,0.0002637555,0.0004522845,0.0004846101,0.0003463145,0.0008134244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001442911,"about_ca_system_score_gemma":0.00006509142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000867342,"about_ca_topic_score_gemma":0.000155236,"domain_scores_codex":[0.9973851,0.000005815903,0.0004654669,0.0008754731,0.0006396369,0.0006285181],"domain_scores_gemma":[0.9987875,0.000127422,0.0001884643,0.0006084365,0.0002456256,0.00004258765],"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.000008367739,0.00003947783,0.00001387372,0.0001152486,0.00001283208,0.00000410887,0.00009559685,0.00679163,0.000006724394,0.002427223,0.0006617946,0.9898231],"study_design_scores_gemma":[0.0003123115,0.00003786017,0.00006832692,0.0002393802,0.00002671683,0.000001198367,4.598553e-7,0.9124685,0.00002121227,0.008600577,0.07773584,0.0004876073],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007463301,0.0001196734,0.9845439,0.001845418,0.002312236,0.0008504929,0.00001067543,0.0001546938,0.01008828],"genre_scores_gemma":[0.08192506,0.00007379689,0.8187565,0.04488119,0.03637249,0.0001215289,0.0007974668,0.0004104904,0.01666143],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9893355,"threshold_uncertainty_score":0.9999645,"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."}}