{"id":"W2805325553","doi":"10.1007/s00453-018-0458-x","title":"LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Facility location problem; Theory of computation; Routing (electronic design automation); Computer science; Network planning and design; Approximation algorithm; Linear programming; Upper and lower bounds; Mathematical optimization; 1-center problem; Integer programming; Mathematics; Algorithm; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001226509,0.0002331929,0.0002217381,0.0002249608,0.0003243196,0.0001160321,0.000274269,0.0001055402,0.0004628581],"category_scores_gemma":[0.000192978,0.0002443954,0.00007622606,0.0009368993,0.0001241586,0.0005677544,0.00009795337,0.00008282049,0.001125592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001710856,"about_ca_system_score_gemma":0.00004119914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005325848,"about_ca_topic_score_gemma":0.0004529024,"domain_scores_codex":[0.9981661,0.00003316191,0.0005097979,0.0005225283,0.0002932866,0.0004751456],"domain_scores_gemma":[0.9989646,0.0000553634,0.0001229672,0.0004043318,0.0004307193,0.00002202745],"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.0009136798,0.001165128,0.002292279,0.001492729,0.0001355378,0.000004472478,0.000332181,0.2625861,0.0003526408,0.01905245,0.1438812,0.5677916],"study_design_scores_gemma":[0.0009476012,0.00004666581,0.002147596,0.00002881064,0.000030661,1.63014e-7,0.00004509018,0.9111032,0.0003001028,0.003161081,0.08188461,0.0003044361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005444732,0.00004816638,0.9886544,0.001833657,0.0008940661,0.001602456,0.00001142115,0.0002148134,0.001296336],"genre_scores_gemma":[0.9147101,0.000006043134,0.07523054,0.003618195,0.002975597,0.001022487,0.0009751365,0.00005279317,0.001409091],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9134238,"threshold_uncertainty_score":0.9996521,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05242191817233216,"score_gpt":0.2605518416760623,"score_spread":0.2081299235037302,"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."}}