{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001186723,0.0004126688,0.0004368492,0.0002743777,0.0002449282,0.0001670783,0.0003702301,0.0002923815,0.00002768546],"category_scores_gemma":[0.000246726,0.000332504,0.000224634,0.0002904109,0.00007623988,0.001101359,0.00005241976,0.0001989449,0.00005566555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000246978,"about_ca_system_score_gemma":0.00003545192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002830647,"about_ca_topic_score_gemma":0.000002519787,"domain_scores_codex":[0.9973064,0.00003566436,0.001287409,0.0002468693,0.000322269,0.0008013758],"domain_scores_gemma":[0.9983164,0.0003246977,0.0002976035,0.0004955901,0.0003865711,0.0001791271],"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.0004744942,0.0007333377,0.004844179,0.01376506,0.002040344,0.000004768413,0.05241991,0.4874979,0.0188946,0.01175419,0.01956078,0.3880104],"study_design_scores_gemma":[0.003378224,0.0001503779,0.00008038495,0.0003344587,0.00005169271,0.0000199036,0.000423502,0.9644246,0.008803693,0.00102128,0.02069923,0.0006127246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02778503,0.00002789088,0.9660276,0.0001280042,0.0007905627,0.002161201,0.0005998051,0.001040567,0.0014394],"genre_scores_gemma":[0.1789645,0.00008429525,0.8180455,0.0001669225,0.0003126885,0.0008792476,0.0006772213,0.0002309944,0.0006385801],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4769266,"threshold_uncertainty_score":0.9999127,"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."}}