{"id":"W2152727633","doi":"10.1145/944618.944629","title":"Solving a \"Hard\" problem to approximate an \"Easy\" one","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Heuristic; Matching (statistics); Mathematical optimization; Travelling salesman problem; Duality (order theory); Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362151,0.0002077732,0.0003116167,0.0003248758,0.0001895607,0.000242801,0.002716275,0.00005846505,0.00007419412],"category_scores_gemma":[0.00009926582,0.0001948507,0.0001276585,0.0005729133,0.00007648044,0.001716838,0.0008349819,0.0003654458,0.00005024655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001767671,"about_ca_system_score_gemma":0.00003461076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004014449,"about_ca_topic_score_gemma":3.875402e-7,"domain_scores_codex":[0.9976645,0.0001299482,0.0005202824,0.0003441802,0.0008024145,0.0005386491],"domain_scores_gemma":[0.9980916,0.00008431183,0.0002452299,0.0008240648,0.0002453711,0.0005094542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001768071,0.003556254,0.0002742547,0.00003097883,0.0002338972,0.0006245044,0.0139776,0.0009753841,0.7306497,0.05118788,0.001563757,0.196749],"study_design_scores_gemma":[0.004718468,0.008973921,0.000293426,0.0003943421,0.00003098478,0.003210527,0.00251513,0.1918752,0.675935,0.1051921,0.005067355,0.001793616],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2181423,0.003716988,0.7733507,0.001614853,0.0007084102,0.0006261294,0.000007259069,0.0001532354,0.001680106],"genre_scores_gemma":[0.2161852,0.00006558687,0.7830274,0.0003284279,0.0002216607,0.00001204908,5.145711e-7,0.00002656951,0.0001325606],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1949554,"threshold_uncertainty_score":0.7945782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05586580032839563,"score_gpt":0.3173452730164984,"score_spread":0.2614794726881028,"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."}}