{"id":"W1977160818","doi":"10.1016/j.dam.2014.10.022","title":"Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Mathematics; Minimax; Vertex (graph theory); Cactus; Algorithm; Tree (set theory); Path (computing); Time complexity; Combinatorics; Minimum spanning tree; Binary logarithm; Computer science; Mathematical optimization; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.0007477116,0.0003139382,0.0003457824,0.0001280034,0.0002211152,0.0002189589,0.0004249509,0.0001051939,0.0002658824],"category_scores_gemma":[0.0001122697,0.0002776728,0.0001597784,0.0002554362,0.00005986789,0.0002688811,0.0002141336,0.0001167572,0.0004632479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003640453,"about_ca_system_score_gemma":0.000006985052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003508341,"about_ca_topic_score_gemma":0.00006820782,"domain_scores_codex":[0.9981912,0.00000496406,0.0005365807,0.0004018227,0.0003850115,0.000480397],"domain_scores_gemma":[0.9989473,0.00005406493,0.0001806263,0.0006429006,0.0001432027,0.00003188237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006076487,0.0004342411,0.00009156174,0.001849369,0.0001385337,0.00000101919,0.0003510112,0.002988115,0.0001095655,0.8431003,0.08083867,0.07003684],"study_design_scores_gemma":[0.001028369,0.00001238851,0.0001221229,0.00005270764,0.0001062915,3.931722e-7,0.0006045189,0.6657073,0.00002077523,0.0223746,0.3095196,0.0004509085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005463957,0.00002910632,0.8484332,0.001328548,0.0007944238,0.001536026,0.00001392098,0.0003745871,0.1420262],"genre_scores_gemma":[0.9345839,0.00004362262,0.05304062,0.005759979,0.002343464,0.0008074498,0.0007341005,0.0001817773,0.00250506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9291199,"threshold_uncertainty_score":0.9999675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02427718616392232,"score_gpt":0.2396000434082767,"score_spread":0.2153228572443543,"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."}}