{"id":"W1982991648","doi":"10.5555/365411.365430","title":"Optimal covering tours with turn costs","year":2001,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arc routing; Travelling salesman problem; Mathematical optimization; Computer science; Routing (electronic design automation); Approximation algorithm; Path (computing); Computational geometry; Polynomial-time approximation scheme; Class (philosophy); Completeness (order theory); Arc (geometry); Time complexity; Mathematics; Algorithm; Artificial intelligence; Geometry","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.0003270404,0.0004215526,0.0005973917,0.0004609995,0.0004538601,0.001180314,0.0007794051,0.0007650568,0.006033571],"category_scores_gemma":[0.002735849,0.0003825633,0.000686422,0.0009063442,0.0006794478,0.001348719,0.0008280416,0.0007651924,0.0003798635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001297414,"about_ca_system_score_gemma":0.0006369189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003211463,"about_ca_topic_score_gemma":0.003277621,"domain_scores_codex":[0.9995246,0.000131144,0.00001720299,0.00008264377,0.0001234502,0.0001210609],"domain_scores_gemma":[0.9987854,0.0007631073,0.0001203316,0.0001686596,0.00006709979,0.00009523225],"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.0003501691,0.0001357723,0.002466345,0.0002364837,0.00005303657,0.0001930612,0.0003807963,0.76009,0.004575187,0.1299013,0.008778911,0.09283894],"study_design_scores_gemma":[0.00007029223,0.0001130879,0.0009896616,0.00003116831,0.0000196704,0.0001982045,0.0001301704,0.904076,0.001816159,0.0852234,0.007320131,0.00001197342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4591197,0.0008264575,0.5111296,0.0008761641,0.00005366014,0.0001623799,0.0005802479,0.0007032868,0.02654861],"genre_scores_gemma":[0.804865,0.0005315539,0.1866325,0.0001182724,0.00003882652,0.0001734798,0.001082765,0.0001197353,0.006437798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006033571,"threshold_uncertainty_score":0.02018428,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009435230428336246,"score_gpt":0.2238616418722822,"score_spread":0.214426411443946,"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."}}