{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452467,0.001276714,0.0009799822,0.000857676,0.0008545349,0.001139054,0.001709694,0.001905252,0.01073825],"category_scores_gemma":[0.009800095,0.0004474419,0.0008915922,0.001017797,0.001309921,0.003829403,0.002024291,0.001616799,0.0009603899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000951793,"about_ca_system_score_gemma":0.001027986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002076816,"about_ca_topic_score_gemma":0.002161204,"domain_scores_codex":[0.9989002,0.0003631619,0.00004004322,0.0002943752,0.0001924969,0.0002097627],"domain_scores_gemma":[0.9973235,0.001796914,0.0002436792,0.0003485794,0.0001633433,0.0001239675],"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.0003573235,0.0003497732,0.001306299,0.0003500951,0.00008194336,0.0001834094,0.00009390651,0.7989491,0.002145546,0.1029454,0.006521345,0.08671581],"study_design_scores_gemma":[0.00007796821,0.0001340408,0.0002795765,0.00002598324,0.00002013837,0.00007214602,0.00009815685,0.9164858,0.001320619,0.07807337,0.003398301,0.00001379435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2710157,0.0008070616,0.6842739,0.003004882,0.0003438043,0.0002374089,0.0004641082,0.001045043,0.03880808],"genre_scores_gemma":[0.5409044,0.0004029364,0.449927,0.0003983883,0.0001608287,0.0002714998,0.0005735511,0.0002160382,0.007145404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01073825,"threshold_uncertainty_score":0.03592306,"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."}}