{"id":"W2144918053","doi":"10.1109/acc.2013.6580451","title":"The maximum traveling salesman problem with submodular rewards","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Travelling salesman problem; Hamiltonian path; Greedy algorithm; Combinatorics; Approximation algorithm; Mathematics; Graph; Curvature; Function (biology); Matching (statistics); Computer science; Mathematical optimization; Discrete mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000273452,0.0001222686,0.0000961533,0.00003106383,0.0004338374,0.0004978155,0.001080407,0.00003082267,0.0000375106],"category_scores_gemma":[0.000006464506,0.00006638018,0.00004745438,0.0003384635,0.0001146416,0.0003917094,0.0001876903,0.0001450453,0.0001195681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001391866,"about_ca_system_score_gemma":0.000040926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001981178,"about_ca_topic_score_gemma":0.00009914107,"domain_scores_codex":[0.9988751,0.00003989966,0.0001595318,0.0002922456,0.0002902943,0.0003429099],"domain_scores_gemma":[0.9990494,0.00007815294,0.00004315876,0.0006421573,0.0001037668,0.00008338672],"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.000003623215,0.00005732472,0.0005265344,0.00001307963,0.00004157588,0.00001071172,0.0006654112,0.0001151775,0.0002304008,0.6057124,0.002672356,0.3899514],"study_design_scores_gemma":[0.0006359661,0.0003304982,0.01099693,0.00005312918,0.000008947555,0.0001198481,0.0003008896,0.2155155,0.002207872,0.7279941,0.04120813,0.0006281535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01642983,0.0001013533,0.9503276,0.005991252,0.0001807227,0.000396151,3.889904e-7,0.0003403861,0.02623227],"genre_scores_gemma":[0.6008536,0.0000296655,0.3963067,0.0005146425,0.00008800085,0.00008059715,0.000001007637,0.00001400097,0.00211184],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5844237,"threshold_uncertainty_score":0.4800447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008415098594869191,"score_gpt":0.1908954649566015,"score_spread":0.1824803663617323,"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."}}