{"id":"W1714443387","doi":"10.1007/978-3-642-20807-2_8","title":"Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Facility location problem; Steiner tree problem; Connection (principal bundle); Metric space; Combinatorics; Metric (unit); Approximation algorithm; Tree (set theory); Generalization; Latency (audio); Path (computing); Time complexity; Computer science; Linear programming; Discrete mathematics; Mathematics; Mathematical optimization; Telecommunications; Computer network; Geometry","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.002833707,0.002621251,0.0021453,0.001450307,0.001026353,0.002615353,0.005069275,0.002246286,0.008933234],"category_scores_gemma":[0.009883458,0.001797355,0.002408693,0.003788179,0.001494869,0.005409039,0.00309689,0.007812407,0.001413904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00222191,"about_ca_system_score_gemma":0.002355335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004751847,"about_ca_topic_score_gemma":0.00475839,"domain_scores_codex":[0.9979674,0.0008208073,0.00008277511,0.0002506531,0.0006084482,0.000269848],"domain_scores_gemma":[0.9943365,0.004338933,0.0003179447,0.0003365682,0.0005016198,0.0001683672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001649744,0.0002201972,0.0002748181,0.000572443,0.00008465759,0.00007030996,0.0002577387,0.711974,0.002964865,0.1729937,0.01105714,0.09936505],"study_design_scores_gemma":[0.00002036589,0.00003117896,0.00005048866,0.00003041279,0.00001599704,0.00002210726,0.0000326398,0.9155387,0.0005913523,0.08158383,0.002071587,0.00001128421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001355693,0.0003843918,0.995142,0.0001969489,0.00004357738,0.00003369847,0.00004114358,0.0001461725,0.002656381],"genre_scores_gemma":[0.1137686,0.00180527,0.8669868,0.0003351741,0.0004704653,0.0005963336,0.0003081985,0.0007479414,0.01498117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008933234,"threshold_uncertainty_score":0.0298847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03644245027914859,"score_gpt":0.2352094268233452,"score_spread":0.1987669765441966,"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."}}