{"id":"W2905953446","doi":"10.1007/978-3-030-18126-0_2","title":"A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Partition (number theory); Approximation algorithm; Vertex cover; Partition problem; Combinatorics; Vertex (graph theory); Cover (algebra); Graph partition; Path (computing); Mathematics; Set cover problem; Computer science; Graph; Algorithm; Discrete mathematics; Set (abstract data type)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001785247,0.0004714133,0.0004419365,0.0005090599,0.0005591463,0.0007552033,0.003510377,0.0002915607,0.00001465092],"category_scores_gemma":[0.00003376868,0.0003575525,0.0002253709,0.0006941009,0.0009916406,0.0006472945,0.001168132,0.0008071365,0.00004640257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002646473,"about_ca_system_score_gemma":0.0007298847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002539668,"about_ca_topic_score_gemma":0.00003465777,"domain_scores_codex":[0.9959944,0.00005065521,0.0005372618,0.001476392,0.001170227,0.0007710297],"domain_scores_gemma":[0.9965388,0.001183927,0.0002418101,0.001502115,0.000413434,0.0001199522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004130108,0.00002686204,0.000001687091,0.00005257006,0.00001222174,0.000006452719,0.0005092943,0.02021357,0.00001469558,0.05572501,0.00005359832,0.9233799],"study_design_scores_gemma":[0.0002570904,0.0002209732,0.00001592641,0.000221127,0.000008592446,0.00003491847,6.177453e-7,0.7740415,0.0003560386,0.2221385,0.002343567,0.0003612197],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00000430599,0.0003861988,0.9937509,0.001612132,0.001641281,0.001577209,0.00002200156,0.0001438017,0.0008621259],"genre_scores_gemma":[0.008159294,0.00005607931,0.989566,0.0009863992,0.000548553,0.00007313189,0.000020772,0.00003737526,0.0005524264],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9230187,"threshold_uncertainty_score":0.9998876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02675681157256715,"score_gpt":0.2585026682017342,"score_spread":0.2317458566291671,"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."}}