{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001014228,0.0004357679,0.0003461503,0.0006545476,0.0002753971,0.0002481328,0.0007664068,0.0001889827,0.00007783881],"category_scores_gemma":[0.00008400426,0.0003569427,0.00009329084,0.0005869579,0.0004188327,0.0006206428,0.0002489624,0.0002692878,0.00005845429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001416314,"about_ca_system_score_gemma":0.0001704279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000383414,"about_ca_topic_score_gemma":0.0009729583,"domain_scores_codex":[0.9973665,0.000005752749,0.0005338129,0.001034302,0.0005674066,0.0004922239],"domain_scores_gemma":[0.9982318,0.00004072428,0.0002378203,0.0006531174,0.0008077052,0.00002880089],"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.00009181712,0.0002271699,0.0008585435,0.002630061,0.00003023257,0.000005711811,0.0003890365,0.05649708,0.00003597755,0.006855017,0.00009645591,0.9322829],"study_design_scores_gemma":[0.0007158619,0.0003481709,0.0004206806,0.001352974,0.0001037523,0.000001669896,0.000003355372,0.7916129,0.0004465389,0.02950163,0.1738805,0.001611967],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002203868,0.00006414013,0.9938687,0.0006071756,0.0004634944,0.00216529,0.000006494025,0.000286896,0.002317433],"genre_scores_gemma":[0.6469434,0.00003627536,0.3432113,0.005222172,0.001402139,0.0008076504,0.0004189908,0.0001251692,0.001832859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9306709,"threshold_uncertainty_score":0.9998882,"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."}}