{"id":"W2250014226","doi":"10.5555/2722129.2722164","title":"Linear programming-based approximation algorithms for multi-vehicle minimum latency problems: extended abstract","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Approximation algorithm; Linear programming; Latency (audio); Leverage (statistics); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Computer network; Artificial intelligence; Telecommunications","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.002181598,0.001413217,0.001117743,0.0007160935,0.0007233511,0.002088961,0.002211497,0.001616837,0.007376805],"category_scores_gemma":[0.005498129,0.0006252007,0.001131778,0.001713878,0.0007792821,0.002386265,0.00175341,0.003074516,0.00177755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002068526,"about_ca_system_score_gemma":0.002105325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00767233,"about_ca_topic_score_gemma":0.008119266,"domain_scores_codex":[0.9987876,0.0004599402,0.00004604095,0.0002152689,0.0002207828,0.0002703573],"domain_scores_gemma":[0.9976922,0.001565833,0.0001793626,0.0002144455,0.0002390859,0.000109054],"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.0001766145,0.0002041626,0.0006218617,0.0001760067,0.00004820436,0.00006042014,0.00007950261,0.9094443,0.000599657,0.0319447,0.006920706,0.04972378],"study_design_scores_gemma":[0.00001962602,0.00001697226,0.00003533936,0.00001223168,0.00000449054,0.0000101084,0.00002069588,0.9861993,0.0001954287,0.01270409,0.0007787101,0.000003000934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01727614,0.0008687148,0.9686267,0.001136655,0.0001391721,0.00009778132,0.000219172,0.0008703165,0.01076535],"genre_scores_gemma":[0.3504683,0.0008483324,0.6369488,0.0007223031,0.0002301457,0.0004801309,0.0008386113,0.0004717643,0.008991613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00767233,"threshold_uncertainty_score":0.02467793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05793689123546252,"score_gpt":0.3169633368533685,"score_spread":0.2590264456179059,"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."}}