{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362464,0.0002480682,0.000213162,0.0002056696,0.000151377,0.0001754626,0.000379618,0.0001993669,0.00000387451],"category_scores_gemma":[0.00004652188,0.000200007,0.00004256896,0.0002039066,0.0002994762,0.0001138423,0.00008561948,0.0003800542,0.000001756287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009795597,"about_ca_system_score_gemma":0.00004092247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000134502,"about_ca_topic_score_gemma":0.00001027349,"domain_scores_codex":[0.9986996,0.00001016108,0.0003022332,0.0004113442,0.0002721723,0.0003044943],"domain_scores_gemma":[0.9989313,0.000544931,0.00007926426,0.0002883451,0.0001046668,0.00005147339],"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":[9.558489e-7,0.000001019407,0.00000987665,0.00005472645,0.000004538396,5.515188e-7,0.0004978011,0.6226964,0.00002299816,0.000328497,0.000002106336,0.3763805],"study_design_scores_gemma":[0.0001356309,0.00002163755,0.00007363254,0.0001462739,0.00001165565,0.00001084054,4.469497e-7,0.9881417,0.0003228143,0.01061689,0.000286133,0.000232346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003414689,0.0001849813,0.9972056,0.000132504,0.0004029239,0.0005973111,0.000004000434,0.0001376814,0.001300811],"genre_scores_gemma":[0.00962299,0.00005270512,0.9896861,0.0001430596,0.0003447187,0.000008844656,0.00000550505,0.00004878248,0.00008732351],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3761482,"threshold_uncertainty_score":0.815605,"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."}}