{"id":"W6910549475","doi":"10.4230/lipics.isaac.2022.8","title":"Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Approximation algorithm; Vertex (graph theory); Degree (music); Steiner tree problem; Multiset; Vertex cover; Graph; Spanning tree","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.001455088,0.0004545943,0.0005104644,0.0003919672,0.0007555173,0.0003500127,0.0006712949,0.0001849189,0.0001898204],"category_scores_gemma":[0.0001505974,0.0005092348,0.0002866792,0.0004981755,0.00006603038,0.0009514081,0.0002505417,0.0004733399,0.00003465239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004208795,"about_ca_system_score_gemma":0.00006060274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006201019,"about_ca_topic_score_gemma":0.000003603141,"domain_scores_codex":[0.9969842,0.00007527057,0.001281898,0.0002689211,0.0005348826,0.0008548041],"domain_scores_gemma":[0.9984296,0.0002168857,0.000304091,0.0006320382,0.0002372421,0.0001801627],"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.0008817709,0.001237834,0.00346211,0.009276251,0.001707724,0.00001305236,0.0513074,0.5796323,0.00213842,0.01849951,0.1232266,0.208617],"study_design_scores_gemma":[0.002636312,0.00018162,0.0001170055,0.00003351709,0.00005465015,0.00004573979,0.001353652,0.8795989,0.001021296,0.0007741625,0.1136044,0.0005787578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04448785,0.00007671415,0.9419662,0.0001809651,0.002668246,0.002611706,0.00394347,0.001047038,0.003017827],"genre_scores_gemma":[0.2019282,0.00003569692,0.785908,0.0007578577,0.0004968718,0.00237464,0.007611353,0.0003355,0.0005518327],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2999665,"threshold_uncertainty_score":0.999736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04451651043492749,"score_gpt":0.2975426499836915,"score_spread":0.253026139548764,"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."}}