{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213805,0.001127241,0.001555033,0.0005040389,0.0005986405,0.001268264,0.001652952,0.001589189,0.004301418],"category_scores_gemma":[0.004246135,0.0005307382,0.0007604742,0.001285585,0.0007792179,0.003743951,0.001248325,0.00136536,0.0006799061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039111,"about_ca_system_score_gemma":0.001090553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001420906,"about_ca_topic_score_gemma":0.001391916,"domain_scores_codex":[0.9991643,0.0003439549,0.00002843921,0.0002204599,0.0001129104,0.0001298829],"domain_scores_gemma":[0.9986059,0.0009626159,0.0001417602,0.0001069728,0.00007232976,0.000110344],"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.0004774764,0.0002048807,0.0008118369,0.0004210772,0.0001265817,0.0003534886,0.0001696175,0.7876072,0.00226322,0.09619802,0.007960089,0.1034065],"study_design_scores_gemma":[0.00005751518,0.0001031442,0.0002197146,0.00001538956,0.00001922521,0.0001472019,0.00005206797,0.8856387,0.0007862367,0.110247,0.002700176,0.00001370978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1173907,0.001111096,0.8688416,0.00148444,0.0001466841,0.0001893644,0.0005107439,0.0008139992,0.009511439],"genre_scores_gemma":[0.6758755,0.0006840456,0.3146196,0.0003133856,0.0001750501,0.0002358643,0.0005071174,0.0002203306,0.007369095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004301418,"threshold_uncertainty_score":0.01438969,"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."}}