{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005335181,0.0004070022,0.0003666404,0.0003756653,0.0004457154,0.0004402665,0.001107907,0.000192808,0.00001815861],"category_scores_gemma":[0.00005955602,0.0003559271,0.0001473605,0.001345073,0.0001991049,0.0005381595,0.0003813226,0.0007648719,0.00005157329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002405767,"about_ca_system_score_gemma":0.0000602076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009829803,"about_ca_topic_score_gemma":0.00003108284,"domain_scores_codex":[0.9972224,0.00009675469,0.0004410848,0.0009986671,0.0005672025,0.0006739086],"domain_scores_gemma":[0.9982219,0.00020784,0.0001570645,0.0009561472,0.0001203902,0.0003366527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004062082,0.0008810429,0.003148595,0.0002289269,0.0002642792,0.0002347671,0.003952698,0.0002228504,0.04452967,0.2912487,0.001355107,0.6538928],"study_design_scores_gemma":[0.002779436,0.001365307,0.03408733,0.0002565579,0.00007468067,0.0003364087,0.00006848514,0.8610567,0.009266636,0.0666084,0.02160929,0.002490798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2476582,0.002462551,0.6070995,0.01464061,0.01562499,0.0040536,0.0002587888,0.007640324,0.1005614],"genre_scores_gemma":[0.813997,0.0005537362,0.1834542,0.0004647907,0.0005817824,0.00009848763,0.00003631467,0.00007582361,0.0007379337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8608338,"threshold_uncertainty_score":0.9998893,"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."}}