{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006541124,0.0000913264,0.0001898056,0.0003453985,0.0007225759,0.0002435072,0.0004075766,0.00006601939,0.00001638611],"category_scores_gemma":[0.0001076178,0.000065651,0.0000829694,0.001023285,0.00005818233,0.0005610033,0.00004281303,0.0001862138,0.000002259754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001035341,"about_ca_system_score_gemma":0.0005212546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003100914,"about_ca_topic_score_gemma":0.0006136157,"domain_scores_codex":[0.9987197,0.0001651579,0.0003811427,0.0001168218,0.0004202146,0.0001969448],"domain_scores_gemma":[0.998217,0.0001221123,0.0002877775,0.0001282129,0.0009952759,0.0002495468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001614776,0.00003796671,0.000316834,0.000002646632,0.0001912973,0.00001948455,0.0009697797,0.4659965,0.000004585108,0.5316869,0.0004485637,0.0003093168],"study_design_scores_gemma":[0.001294731,0.0002593046,0.001058093,0.00001328798,0.00007276633,0.00009040046,0.00004640727,0.9853584,0.00007697709,0.003910818,0.007649157,0.0001696842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001350444,0.0008027229,0.9654975,0.008935316,0.002467899,0.0005382188,0.00000359732,0.00004449622,0.02035982],"genre_scores_gemma":[0.9248303,0.001264071,0.07331842,0.000145605,0.0001371631,0.000003449101,0.000003286817,0.000009351854,0.0002883418],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9234799,"threshold_uncertainty_score":0.5557543,"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."}}