{"id":"W3027490412","doi":"10.1016/j.tcs.2020.05.010","title":"Local search is a PTAS for feedback vertex set in minor-free graphs","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Vertex (graph theory); Minor (academic); Robertson–Seymour theorem; Local search (optimization); Mathematics; Feedback vertex set; Set (abstract data type); Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Graph; 1-planar graph; Chordal graph","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.001667218,0.001161147,0.002854654,0.001549398,0.002446631,0.00211844,0.00400204,0.002395331,0.008260837],"category_scores_gemma":[0.01259927,0.0007731956,0.001795758,0.002253396,0.001776544,0.004955013,0.003402774,0.00275031,0.001391512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00201369,"about_ca_system_score_gemma":0.003500946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004212493,"about_ca_topic_score_gemma":0.005607212,"domain_scores_codex":[0.9979451,0.0005966875,0.0001070432,0.0006201125,0.0003970669,0.0003338786],"domain_scores_gemma":[0.991985,0.004365374,0.0005681493,0.001591409,0.0007728589,0.000717181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002437698,0.0008302955,0.002958122,0.001310277,0.0003140462,0.0004451411,0.0008684104,0.3496871,0.01943117,0.3686972,0.03460781,0.2184128],"study_design_scores_gemma":[0.0001323626,0.0002500014,0.0002811461,0.00004377861,0.0001001893,0.0002203365,0.0001132277,0.7595786,0.003100268,0.2335206,0.002625958,0.00003351233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1348416,0.0005604257,0.8463516,0.001543851,0.0001811873,0.0005216859,0.001028992,0.003223325,0.01174736],"genre_scores_gemma":[0.8029515,0.0003394971,0.1807294,0.0005393234,0.0001428222,0.0005382672,0.0009911547,0.0004771265,0.01329091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008260837,"threshold_uncertainty_score":0.02763528,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03530793057521974,"score_gpt":0.3088514233584,"score_spread":0.2735434927831803,"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."}}