{"id":"W2078856178","doi":"10.1007/s10878-008-9156-y","title":"The canadian traveller problem and its competitive analysis","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Theory of computation; Vertex (graph theory); Computer science; Competitive analysis; Adaptive strategies; Graph; Grid; Mathematical optimization; Shortest path problem; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Upper and lower bounds; Artificial intelligence; Geography","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002038613,0.001770045,0.001769412,0.00187932,0.003194837,0.004188172,0.005376137,0.003330444,0.02318485],"category_scores_gemma":[0.01374244,0.0005178149,0.001053135,0.003437602,0.002672959,0.005057308,0.002584066,0.002989682,0.001578121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007956333,"about_ca_system_score_gemma":0.00658196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.09749472,"about_ca_topic_score_gemma":0.061604,"domain_scores_codex":[0.9970971,0.0008695553,0.0000612166,0.0004863375,0.0007224403,0.0007633748],"domain_scores_gemma":[0.9932628,0.004159508,0.000477424,0.0004033227,0.0007647344,0.0009321522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006532067,0.0003577366,0.002424945,0.0004333124,0.0001388079,0.0004272479,0.0004946652,0.2128259,0.001146364,0.690898,0.03959916,0.05060074],"study_design_scores_gemma":[0.0002050749,0.0001758111,0.001099262,0.00005724116,0.00007242049,0.0003383165,0.0003607248,0.6614684,0.0006877746,0.312147,0.02331035,0.00007758397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2314587,0.003963054,0.379301,0.01015623,0.0003470512,0.0009083451,0.00280183,0.0008041481,0.3702596],"genre_scores_gemma":[0.8960212,0.002497258,0.05991071,0.0009211478,0.0003462244,0.0005776406,0.001458446,0.000262678,0.03800478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09749472,"threshold_uncertainty_score":0.1938545,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01421972525174794,"score_gpt":0.2319537224110097,"score_spread":0.2177339971592618,"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."}}