{"id":"W1583951675","doi":"10.1007/978-3-540-73545-8_54","title":"Approximation Algorithms for the Black and White Traveling Salesman Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Combinatorics; Triangle inequality; Bounded function; Approximation algorithm; Mathematics; Undirected graph; Hamiltonian (control theory); Hamiltonian path; Graph; Discrete mathematics; Algorithm; 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.002100585,0.001738593,0.002220327,0.001330027,0.001191799,0.002790738,0.004158433,0.002435569,0.01065115],"category_scores_gemma":[0.007513994,0.00114042,0.001393603,0.003373512,0.001243855,0.005107198,0.002097717,0.0039144,0.002243968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002464409,"about_ca_system_score_gemma":0.002012203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007474968,"about_ca_topic_score_gemma":0.006833023,"domain_scores_codex":[0.9987736,0.0003749591,0.00004219332,0.0002469368,0.0003295052,0.0002328061],"domain_scores_gemma":[0.9976557,0.001547748,0.0001465466,0.000263641,0.0002427011,0.0001436232],"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.0004285647,0.0004056813,0.0004902023,0.0002785077,0.0001278603,0.00007297208,0.0001694113,0.5438083,0.0009031106,0.1873458,0.02899653,0.2369731],"study_design_scores_gemma":[0.0000656628,0.00002958418,0.00006481832,0.00002082208,0.00002267308,0.00002682284,0.00003417155,0.8958812,0.0002481858,0.1007117,0.002885583,0.000008747296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01253492,0.001821859,0.96878,0.0008750123,0.0002728451,0.00008798114,0.0002087012,0.0009022175,0.0145165],"genre_scores_gemma":[0.2487788,0.002594044,0.7175661,0.0006045469,0.0004805493,0.0004377895,0.001175232,0.0007606374,0.02760216],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01065115,"threshold_uncertainty_score":0.0356316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03269764042657921,"score_gpt":0.2746206724767289,"score_spread":0.2419230320501497,"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."}}