{"id":"W2910174849","doi":"10.1007/s10878-019-00378-1","title":"On the randomized online strategies for the k-Canadian traveler problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Theory of computation; Combinatorics; Graph; Randomized algorithm; Computer science; Disjoint sets; Undirected graph; Node (physics); Online algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Upper and lower bounds; Mathematical optimization; Algorithm; Artificial intelligence; Physics","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.003792421,0.002485055,0.004881631,0.002077412,0.002623945,0.004198231,0.005940137,0.005042648,0.0200443],"category_scores_gemma":[0.01964436,0.001287684,0.001498288,0.003887902,0.003385181,0.006573819,0.003427225,0.004561169,0.001342939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007975682,"about_ca_system_score_gemma":0.01435648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.08928537,"about_ca_topic_score_gemma":0.08661059,"domain_scores_codex":[0.996999,0.001323724,0.00009537648,0.0004133267,0.0003580661,0.0008104801],"domain_scores_gemma":[0.9863641,0.01089416,0.0005071522,0.0006259109,0.000583224,0.001025552],"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.002173945,0.0008663314,0.001378202,0.0006180443,0.0002403532,0.0002217848,0.0004103286,0.6752768,0.0008659407,0.2347174,0.03875415,0.04447669],"study_design_scores_gemma":[0.0004276994,0.0001763391,0.0003781116,0.00006691589,0.00006515592,0.00005460713,0.0002027578,0.8759398,0.0002581355,0.1191121,0.003258385,0.00005994098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3199527,0.005091465,0.5131422,0.01267838,0.0008116176,0.002220024,0.00409735,0.001692123,0.1403141],"genre_scores_gemma":[0.8538904,0.002087325,0.105281,0.001453739,0.0003824896,0.0009200115,0.001974575,0.0005125487,0.03349783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.08928537,"threshold_uncertainty_score":0.1775314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171038450377816,"score_gpt":0.2554739539877305,"score_spread":0.238370108949949,"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."}}