{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005011825,0.00301692,0.005026537,0.001938718,0.002184494,0.003902005,0.008797739,0.004751821,0.01654773],"category_scores_gemma":[0.01850106,0.001510193,0.001547417,0.00427231,0.002337662,0.006428736,0.004739175,0.005602351,0.002155498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006478673,"about_ca_system_score_gemma":0.004898337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008679666,"about_ca_topic_score_gemma":0.01270357,"domain_scores_codex":[0.9972166,0.001027659,0.00009449706,0.0006315535,0.0004024201,0.000627259],"domain_scores_gemma":[0.9848236,0.01125746,0.0007826626,0.001294695,0.000868355,0.0009731574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001134249,0.0005203423,0.0006606354,0.0004792631,0.0001242829,0.0000662411,0.0001299634,0.8135264,0.0005291326,0.07456774,0.03941927,0.06884256],"study_design_scores_gemma":[0.0001125584,0.0000798927,0.0001084497,0.00003443671,0.00002717486,0.00002970448,0.00003680811,0.9354614,0.0002982257,0.06227161,0.001526497,0.00001319541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06450935,0.004166846,0.8927879,0.004432151,0.0005833044,0.0006590759,0.002385618,0.00257791,0.02789788],"genre_scores_gemma":[0.5588519,0.002156992,0.4028802,0.00181741,0.0007357842,0.001203912,0.003582352,0.001511123,0.02726035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01654773,"threshold_uncertainty_score":0.05535769,"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."}}