{"id":"W4407154831","doi":"10.1007/978-3-031-83438-7_18","title":"A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Binary tree; Algorithm; Binary number; Quadratic equation; Sink (geography); Tree (set theory); Optimal binary search tree; Theoretical computer science; K-ary tree; Tree structure; Mathematics; Combinatorics; Arithmetic; Cartography","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.001497029,0.00173197,0.00252105,0.001143015,0.001281742,0.002272671,0.003824219,0.002283573,0.01857818],"category_scores_gemma":[0.005143018,0.000957677,0.00103556,0.002929592,0.001062006,0.004814546,0.003453827,0.002988627,0.003539598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002033507,"about_ca_system_score_gemma":0.002553192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00583993,"about_ca_topic_score_gemma":0.008366061,"domain_scores_codex":[0.9987935,0.0003200845,0.00006009949,0.0003053007,0.0002867351,0.0002342639],"domain_scores_gemma":[0.9975478,0.001648254,0.0001258219,0.0002894808,0.0002444811,0.0001441022],"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.000830968,0.000612843,0.0004786547,0.0005919692,0.00008811379,0.0001028076,0.0002935221,0.4869393,0.004496444,0.05373193,0.04046034,0.4113731],"study_design_scores_gemma":[0.0001991367,0.0001122852,0.0001534483,0.00002441863,0.00002030925,0.00006025047,0.00009157368,0.9487767,0.000721998,0.0464029,0.00342288,0.00001406297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01668399,0.0006159303,0.9678462,0.0009456296,0.0001918524,0.0003059022,0.0005237712,0.00162694,0.01125987],"genre_scores_gemma":[0.1141032,0.0003487272,0.8697114,0.0004132381,0.0001627576,0.0005313813,0.001350373,0.0006157834,0.01276322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01857818,"threshold_uncertainty_score":0.06215018,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01951145377223285,"score_gpt":0.2268256899091289,"score_spread":0.207314236136896,"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."}}