{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446185,0.001185069,0.001625397,0.0009249688,0.000727766,0.001481986,0.002358608,0.001312975,0.003821197],"category_scores_gemma":[0.006091857,0.0005402932,0.000776196,0.002455464,0.0005931864,0.002324454,0.001739766,0.00163358,0.001080888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001652548,"about_ca_system_score_gemma":0.001392332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005309787,"about_ca_topic_score_gemma":0.004064855,"domain_scores_codex":[0.9984477,0.0004531512,0.00009669056,0.000256145,0.0005195365,0.0002268086],"domain_scores_gemma":[0.9977894,0.001207169,0.0001992276,0.0003177757,0.0003059723,0.0001804691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004814652,0.0002750213,0.001447857,0.0002437885,0.0001006199,0.000113599,0.0002982504,0.8346797,0.003205895,0.04620796,0.006167435,0.1067785],"study_design_scores_gemma":[0.00002373036,0.00003643407,0.00007601606,0.00000832825,0.000006299438,0.00002791023,0.00002229508,0.9883807,0.0002720249,0.01030435,0.000838028,0.000003980777],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.05319392,0.001015326,0.9363136,0.0006288806,0.0000881794,0.0001481967,0.0002726029,0.0008875653,0.007451726],"genre_scores_gemma":[0.4965846,0.0005622879,0.4952962,0.0003372558,0.00007222506,0.0003533443,0.0008873288,0.0002814616,0.005625296],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.005309787,"threshold_uncertainty_score":0.01278317,"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."}}