{"id":"W2153817623","doi":"10.1016/j.dam.2015.01.004","title":"Informative path planning as a maximum traveling salesman problem with submodular rewards","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Travelling salesman problem; Greedy algorithm; Mathematical optimization; Hamiltonian path; Graph; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.001628349,0.00119983,0.002674576,0.001146833,0.0009072765,0.002968827,0.003241656,0.003564532,0.00869057],"category_scores_gemma":[0.005948283,0.001485212,0.001472066,0.002794449,0.001418246,0.004416866,0.002072052,0.002832435,0.0006503484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0019705,"about_ca_system_score_gemma":0.001957984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00341293,"about_ca_topic_score_gemma":0.004819495,"domain_scores_codex":[0.9986176,0.0005799998,0.0000550595,0.0003738211,0.000213964,0.0001595217],"domain_scores_gemma":[0.9970553,0.002190772,0.0002512299,0.0001479295,0.0001301127,0.0002246361],"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.0002340007,0.0001640484,0.0003670733,0.0003312748,0.00009878391,0.0002319226,0.0001481319,0.780754,0.0009126958,0.1893675,0.005050465,0.02234013],"study_design_scores_gemma":[0.00004809107,0.00006002132,0.0001024457,0.00002172149,0.00002761029,0.0000463643,0.00003829542,0.8599496,0.0002641535,0.138186,0.001240243,0.00001545849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07762218,0.0007085828,0.9007741,0.001826853,0.0001353216,0.0002230049,0.0008872511,0.0004561899,0.0173665],"genre_scores_gemma":[0.6286606,0.0007507705,0.3454853,0.0003298966,0.0002617264,0.0004900518,0.0008733486,0.0003052561,0.02284312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00869057,"threshold_uncertainty_score":0.02907282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02951044027997913,"score_gpt":0.2557570293357331,"score_spread":0.226246589055754,"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."}}