{"id":"W2577191082","doi":"10.4230/lipics.isaac.2016.56","title":"Approximation Algorithms for Capacitated k-Travelling Repairmen Problems","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Rounding; Vehicle routing problem; Computer science; Approximation algorithm; Latency (audio); Mathematical optimization; Algorithm; Travelling salesman problem; Constant (computer programming); Routing (electronic design automation); Mathematics; Computer network; Telecommunications","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215116,0.002325678,0.0018737,0.001164238,0.0008975053,0.002617829,0.004294002,0.002285012,0.009383113],"category_scores_gemma":[0.01059534,0.0007749296,0.00171495,0.003251966,0.001035465,0.005340102,0.00207812,0.004103422,0.002245276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003292834,"about_ca_system_score_gemma":0.002127409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005822957,"about_ca_topic_score_gemma":0.006832295,"domain_scores_codex":[0.9976978,0.0006990702,0.0001251587,0.0004988988,0.0004698315,0.0005093158],"domain_scores_gemma":[0.9955013,0.002894988,0.0003345253,0.0007006701,0.0003526115,0.0002158777],"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.0004287137,0.0003048293,0.001132242,0.0004550595,0.0001167715,0.000115595,0.0003180632,0.7835944,0.001240803,0.08948471,0.01634614,0.1064626],"study_design_scores_gemma":[0.00005576681,0.00004529877,0.0001149079,0.00003320563,0.00002189745,0.00006469593,0.00008514817,0.9181794,0.0004017004,0.07764009,0.003345125,0.00001275076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02454925,0.002986099,0.9533998,0.001415072,0.0002138639,0.0001519307,0.0006068458,0.001772142,0.01490513],"genre_scores_gemma":[0.4454207,0.002745514,0.5362707,0.0007749235,0.0003955178,0.0004060601,0.002293963,0.0008213685,0.01087121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009383113,"threshold_uncertainty_score":0.03138965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02775715232252206,"score_gpt":0.2597401010769331,"score_spread":0.231982948754411,"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."}}