{"id":"W4285190221","doi":"10.1007/978-3-031-06901-7_19","title":"Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Rounding; Combinatorics; Approximation algorithm; Mathematics; Bounded function; Alpha (finance); Running time; Routing (electronic design automation); Algorithm; Computer science; Mathematical analysis; Statistics","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.002991522,0.00185701,0.002275061,0.001228193,0.0009065744,0.002801443,0.005380552,0.002006741,0.009738219],"category_scores_gemma":[0.01590343,0.001400405,0.001698451,0.002772886,0.001445533,0.003679215,0.002267612,0.005039715,0.001593105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005514052,"about_ca_system_score_gemma":0.003229134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02130527,"about_ca_topic_score_gemma":0.02309402,"domain_scores_codex":[0.9982398,0.0006970151,0.00005250049,0.0002112137,0.0004976938,0.0003018384],"domain_scores_gemma":[0.9923814,0.005545512,0.0002689806,0.0006662548,0.0008620399,0.0002756974],"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.000148578,0.00005736096,0.0001940524,0.00008862314,0.00002352137,0.00004101284,0.00006439796,0.9415883,0.0002903137,0.03961523,0.00413818,0.01375057],"study_design_scores_gemma":[0.000004262471,0.000005850214,0.00001952545,0.000006610128,0.000003707242,0.000004930821,0.000007843772,0.9880595,0.00004763915,0.01148231,0.0003550474,0.000002809085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01944858,0.001163592,0.9620398,0.000690637,0.0002622833,0.00009699965,0.0004606482,0.0005611846,0.01527624],"genre_scores_gemma":[0.4490223,0.001895295,0.5111921,0.0004887325,0.0004061257,0.0005241049,0.001499654,0.00104707,0.03392474],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02130527,"threshold_uncertainty_score":0.04236251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0186541608475317,"score_gpt":0.2393684785668184,"score_spread":0.2207143177192867,"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."}}