{"id":"W4379622149","doi":"10.1016/j.dam.2023.05.022","title":"A local search approximation algorithm for the multiway cut problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Approximation algorithm; Combinatorics; Heuristic; Set (abstract data type); Local search (optimization); Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001074509,0.0007543068,0.001879039,0.001202716,0.0006722346,0.001386904,0.002932323,0.001928769,0.007688331],"category_scores_gemma":[0.004668223,0.0005651383,0.000918107,0.001917808,0.0006383163,0.002595907,0.002060366,0.002697329,0.001475184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001308014,"about_ca_system_score_gemma":0.001454773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003322618,"about_ca_topic_score_gemma":0.004360285,"domain_scores_codex":[0.9992148,0.0002085529,0.00003258653,0.0001708469,0.000254303,0.0001188215],"domain_scores_gemma":[0.998161,0.001097192,0.0001204869,0.0002523533,0.0002229758,0.0001458713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000883588,0.000623999,0.001200323,0.0003033423,0.0001069723,0.0001343774,0.0001971952,0.4443779,0.00623609,0.04879716,0.01463178,0.4825072],"study_design_scores_gemma":[0.00009982198,0.00008334276,0.0001409969,0.00001400491,0.00001922757,0.00004688299,0.0000235655,0.9864427,0.0006222925,0.01121584,0.001281836,0.000009546418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02553899,0.0005560302,0.9679458,0.0004176569,0.0001074716,0.0001133682,0.0001416758,0.0009425391,0.004236559],"genre_scores_gemma":[0.2225552,0.0003099955,0.7686149,0.0002458238,0.0001148669,0.0003685721,0.0006215922,0.0002609804,0.006908178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007688331,"threshold_uncertainty_score":0.02572006,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03813232295211413,"score_gpt":0.2843878693129333,"score_spread":0.2462555463608191,"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."}}