{"id":"W1990177682","doi":"10.5555/1873601.1873636","title":"Asymmetric traveling salesman path and directed latency problems","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Linear programming relaxation; Combinatorics; Approximation algorithm; Binary logarithm; Mathematics; Log-log plot; Path (computing); Upper and lower bounds; Relaxation (psychology); Latency (audio); Linear programming; Discrete mathematics; Computer science; Mathematical optimization","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.001828305,0.001623991,0.001169609,0.001225012,0.0007896933,0.001991368,0.0042983,0.001777976,0.005401441],"category_scores_gemma":[0.01207031,0.0005782119,0.00105664,0.002425845,0.001410993,0.008027821,0.002266183,0.004258407,0.0004922741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487257,"about_ca_system_score_gemma":0.001450337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002918449,"about_ca_topic_score_gemma":0.001840353,"domain_scores_codex":[0.9980877,0.0004590261,0.00008690575,0.0004233347,0.0005308358,0.0004121638],"domain_scores_gemma":[0.9932626,0.00465553,0.0007430456,0.0005285213,0.0004148631,0.0003954742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004148464,0.0003488234,0.001607251,0.0005718802,0.00007828547,0.0002425875,0.0003694218,0.4879091,0.003295302,0.4268686,0.006662276,0.07163171],"study_design_scores_gemma":[0.00004617099,0.0001035692,0.0003002283,0.00004667525,0.00003229217,0.0002026744,0.0001572035,0.7118566,0.001925231,0.2791431,0.006167364,0.00001889397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1145479,0.002063389,0.8603325,0.00221243,0.0002119056,0.0001401364,0.0005639951,0.0006113754,0.01931638],"genre_scores_gemma":[0.6805435,0.002686653,0.3042235,0.0005898895,0.0005109281,0.0002852803,0.0009581749,0.0002946837,0.00990743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005401441,"threshold_uncertainty_score":0.01806957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01167170768584514,"score_gpt":0.2338271851916558,"score_spread":0.2221554775058107,"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."}}