{"id":"W2274566957","doi":"10.1007/978-3-642-35261-4_61","title":"Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights","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":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Regret; Minimax; Vertex (graph theory); Computer science; Tree (set theory); Combinatorics; Algorithm; Mathematical optimization; Theoretical computer science; Graph; Mathematics; 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.003076354,0.002154723,0.004145155,0.001531611,0.0013388,0.003403072,0.00470665,0.004219817,0.009935654],"category_scores_gemma":[0.01341471,0.001524636,0.001833163,0.002474799,0.001676049,0.004929074,0.002566182,0.003653603,0.001399701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004439869,"about_ca_system_score_gemma":0.002214027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008763252,"about_ca_topic_score_gemma":0.01440953,"domain_scores_codex":[0.9985196,0.000486954,0.0000553232,0.0004632862,0.0002187234,0.0002560313],"domain_scores_gemma":[0.9914554,0.006727716,0.0004106635,0.0005269002,0.0004431591,0.0004360003],"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.0004163936,0.0001302135,0.0007825965,0.000192846,0.00008061696,0.00005971384,0.00006088421,0.946937,0.0005538152,0.01368747,0.008113624,0.02898486],"study_design_scores_gemma":[0.00001938651,0.00003121946,0.0001082769,0.00001183535,0.00001120755,0.00001531287,0.00001851692,0.9742319,0.000162921,0.02514971,0.0002344979,0.000005287628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1788468,0.002485423,0.79578,0.004857574,0.000375237,0.0002823925,0.00336439,0.002766144,0.01124214],"genre_scores_gemma":[0.5276252,0.001063204,0.4440556,0.0009342278,0.0005683695,0.0005027523,0.004991868,0.001039911,0.01921882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009935654,"threshold_uncertainty_score":0.03323805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01630337756878972,"score_gpt":0.2134508359052461,"score_spread":0.1971474583364564,"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."}}