{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001206807,0.0005577432,0.0004889718,0.0002679932,0.0001733297,0.0001734898,0.0004083496,0.0003360716,0.00001614273],"category_scores_gemma":[0.0001846901,0.0005440164,0.0002278381,0.0005216062,0.00009358278,0.0003895782,0.00004338577,0.0003712332,0.00006998212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256463,"about_ca_system_score_gemma":0.0001235369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002215645,"about_ca_topic_score_gemma":0.000004507473,"domain_scores_codex":[0.9969642,0.0001054734,0.0008135645,0.0006894328,0.0005851077,0.0008422451],"domain_scores_gemma":[0.9981964,0.0001587183,0.0002080416,0.0006223086,0.0003870052,0.0004275787],"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.0000834486,0.0003860572,0.0001028573,0.0004203151,0.0001125292,0.000009042432,0.0009470212,0.944911,0.004769098,0.0001005131,0.0004751534,0.04768297],"study_design_scores_gemma":[0.003303278,0.0004426431,0.0001548825,0.0001219788,0.00005873084,0.000004587068,0.0001412106,0.9793668,0.01260842,0.000119958,0.002993756,0.0006838033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004583603,0.0002164552,0.9882097,0.0004807996,0.001013316,0.002570213,0.0001379836,0.001847037,0.0009409321],"genre_scores_gemma":[0.07465415,0.00002217815,0.9227457,0.0001021859,0.0004672987,0.0009126606,0.0004295424,0.0002802391,0.0003860249],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07007055,"threshold_uncertainty_score":0.9997011,"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."}}