{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008913136,0.002505612,0.002510399,0.001442953,0.002072293,0.002962165,0.004710438,0.002791072,0.02197563],"category_scores_gemma":[0.004983671,0.0009818658,0.00196443,0.004576412,0.001099388,0.007518846,0.003287693,0.002908996,0.005731015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002963012,"about_ca_system_score_gemma":0.004711511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01159879,"about_ca_topic_score_gemma":0.01327494,"domain_scores_codex":[0.9981832,0.0002694673,0.000111414,0.0005995641,0.0003053907,0.0005310501],"domain_scores_gemma":[0.9975029,0.001374127,0.0002040648,0.0004759636,0.0002314581,0.0002115507],"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.001164337,0.0009535528,0.00144331,0.001891309,0.0002203285,0.0005742774,0.0005591595,0.4412156,0.00688536,0.06923811,0.07414426,0.4017104],"study_design_scores_gemma":[0.0004783125,0.0002097771,0.0003897188,0.00007535702,0.00008417738,0.0003557657,0.0003031104,0.8714808,0.001709888,0.1139515,0.01091253,0.00004900359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05382568,0.001990114,0.8947581,0.002239777,0.0003736063,0.00102823,0.002642401,0.01145788,0.03168428],"genre_scores_gemma":[0.2677905,0.0009807493,0.7109426,0.0005915654,0.0002278366,0.0008092212,0.006409362,0.001136775,0.01111137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02197563,"threshold_uncertainty_score":0.07351583,"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."}}