{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008391897,0.001386216,0.00207505,0.001381845,0.001034591,0.001519715,0.003509005,0.002212198,0.01731478],"category_scores_gemma":[0.002996512,0.0007893645,0.001337453,0.002674959,0.0007186853,0.002710126,0.002624032,0.002769031,0.003905555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002009333,"about_ca_system_score_gemma":0.002242057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004905571,"about_ca_topic_score_gemma":0.007229679,"domain_scores_codex":[0.9992964,0.0001444333,0.00003509044,0.0001646623,0.0002162776,0.000142993],"domain_scores_gemma":[0.9990501,0.0004723912,0.00006969758,0.0002045845,0.0001079205,0.00009531382],"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.001535744,0.0008583624,0.0009348196,0.0005766695,0.0001177789,0.0002029519,0.0003789765,0.2575014,0.01240265,0.04128655,0.04497012,0.639234],"study_design_scores_gemma":[0.0003746342,0.0002471946,0.0003876303,0.00005161402,0.00005520409,0.0001600793,0.0001127848,0.9593514,0.002885957,0.02990668,0.006440675,0.00002616023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06059952,0.001140722,0.911131,0.001004733,0.0002623052,0.0004377872,0.0008470578,0.004854591,0.01972228],"genre_scores_gemma":[0.1229093,0.0003098461,0.8634433,0.0003196757,0.00009540178,0.0005821539,0.001876043,0.0005494001,0.009914957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01731478,"threshold_uncertainty_score":0.05792373,"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."}}