{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006542035,0.000556238,0.0004523456,0.0006492794,0.0004280311,0.0003529478,0.0008824143,0.0001745281,0.0001920425],"category_scores_gemma":[0.00005475526,0.0004453654,0.0000987501,0.0006935608,0.0005013319,0.0006541336,0.0005028485,0.0005471379,0.0003830178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002010057,"about_ca_system_score_gemma":0.00008250539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002887452,"about_ca_topic_score_gemma":0.001841777,"domain_scores_codex":[0.9969658,0.00001394115,0.0004108713,0.0009861983,0.0008779065,0.0007452833],"domain_scores_gemma":[0.9986491,0.0001738301,0.0002329022,0.0006308492,0.0002604524,0.00005284639],"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.0001052164,0.0001002966,0.001045481,0.0002024799,0.00007283736,0.00005430699,0.0006796526,0.07807647,0.000003494357,0.06243416,0.0009804229,0.8562452],"study_design_scores_gemma":[0.001482055,0.0002789698,0.01456567,0.003481489,0.000166097,0.0000115831,0.000005830556,0.835164,0.00007207559,0.1062242,0.03588372,0.002664271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002211689,0.0003125063,0.888539,0.003880572,0.004676378,0.001419178,0.000007492704,0.0002847612,0.0986684],"genre_scores_gemma":[0.9505903,0.00002839143,0.03010253,0.01225569,0.005498585,0.00001449451,0.00009276589,0.00009390622,0.001323334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9483786,"threshold_uncertainty_score":0.9997998,"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."}}