{"id":"W3118763906","doi":"10.1007/s00453-020-00792-6","title":"Approximating the Canadian Traveller Problem with Online Randomization","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Ministry of Science and Technology, Taiwan","keywords":"Competitive analysis; Theory of computation; Randomized algorithm; Combinatorics; Online algorithm; Deterministic algorithm; Bounded function; Time complexity; Vertex (graph theory); Upper and lower bounds; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm; Graph","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.002666116,0.001709547,0.002610558,0.00171111,0.001934036,0.002811678,0.004568251,0.003525969,0.01739021],"category_scores_gemma":[0.01887834,0.0009102239,0.001321283,0.003167175,0.002569527,0.005215586,0.002640356,0.003963379,0.001632701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006810421,"about_ca_system_score_gemma":0.01140535,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.08314238,"about_ca_topic_score_gemma":0.09142665,"domain_scores_codex":[0.997826,0.0008560115,0.0000570236,0.0004340666,0.0003733903,0.0004535135],"domain_scores_gemma":[0.9925891,0.005174272,0.0003258655,0.0008972756,0.0005249894,0.0004884012],"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.0007811565,0.0003540042,0.001251541,0.0002236562,0.00007739057,0.00008419956,0.0000945161,0.7531452,0.0005260185,0.1538235,0.03654812,0.05309061],"study_design_scores_gemma":[0.000120557,0.00004402968,0.000160098,0.00001803175,0.00001664812,0.00002086444,0.00003323649,0.9289927,0.0002051115,0.0683222,0.002049305,0.00001720123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1203129,0.002450428,0.8143281,0.005045623,0.000655363,0.0005481765,0.002100247,0.002783443,0.05177575],"genre_scores_gemma":[0.7050852,0.0009812929,0.262534,0.0008426475,0.0003148476,0.0005533535,0.002436004,0.0008269673,0.02642574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9168576,"threshold_uncertainty_score":0.1653169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01295788017039657,"score_gpt":0.2200355506260261,"score_spread":0.2070776704556295,"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."}}