{"id":"W4403453813","doi":"10.1142/s1793830924501076","title":"A polynomial-time exact algorithm for the connected k-facility location problem on trees","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Time complexity; Facility location problem; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.0005054962,0.0002191064,0.0001883531,0.0001348448,0.0004660566,0.0005592877,0.000230263,0.00005488799,0.0001459379],"category_scores_gemma":[0.00004075562,0.0001544621,0.00009856066,0.0005503683,0.00009293223,0.0002876195,0.00008157573,0.00009730117,0.0004671837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003031572,"about_ca_system_score_gemma":0.00002182746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001575222,"about_ca_topic_score_gemma":0.00003686494,"domain_scores_codex":[0.9987626,0.000006617479,0.0003810704,0.000407851,0.000213611,0.0002282271],"domain_scores_gemma":[0.9991658,0.0001881609,0.00006376451,0.0004033938,0.0001570824,0.00002174459],"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.000009919202,0.0003173435,0.000007169471,0.001293209,0.0002328593,5.262742e-7,0.0003825118,0.001215774,0.0001666632,0.1552312,0.02696546,0.8141774],"study_design_scores_gemma":[0.0001609213,0.00001155205,0.0001237458,0.00004401133,0.0001125755,6.317162e-7,0.0003479024,0.7199969,0.00001622954,0.004807006,0.2741992,0.0001793146],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006762256,0.0005007724,0.9829172,0.006258891,0.0001716055,0.003628667,0.0002185835,0.0004579717,0.005170104],"genre_scores_gemma":[0.7227977,0.001118369,0.1650994,0.007412682,0.01015378,0.0465671,0.006228354,0.0005359747,0.04008659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8178177,"threshold_uncertainty_score":0.629878,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01927807784296741,"score_gpt":0.2526821950377509,"score_spread":0.2334041171947835,"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."}}