{"id":"W2908273849","doi":"10.1007/s10878-018-00372-z","title":"An improved approximation algorithm for the minimum 3-path partition problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Approximation algorithm; Disjoint sets; Partition (number theory); Partition problem; Vertex cover; Theory of computation; Vertex (graph theory); Set cover problem; Discrete mathematics; Graph; Algorithm; Set (abstract data type); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064459,0.0001199388,0.0001728874,0.0001217636,0.0003725111,0.0003274039,0.0007109864,0.00007939062,0.000008718799],"category_scores_gemma":[0.00007497685,0.00008815218,0.0001121642,0.0004052058,0.00008122086,0.001416009,0.00004788173,0.0001293367,0.000001161786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005311551,"about_ca_system_score_gemma":0.0001317836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003446296,"about_ca_topic_score_gemma":3.080299e-7,"domain_scores_codex":[0.9987206,0.0001061906,0.0004952524,0.000167019,0.0003263915,0.0001845238],"domain_scores_gemma":[0.9976919,0.0001551555,0.0006076342,0.0002960208,0.001168756,0.00008056124],"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.0003080864,0.001474709,0.00002728736,0.00005129258,0.0002054527,0.000003853826,0.003380541,0.06476787,0.001675933,0.3136295,0.003361959,0.6111135],"study_design_scores_gemma":[0.001264763,0.001404471,0.00002027821,0.00002034323,0.00002683255,0.00001769384,0.00003451094,0.925954,0.001193908,0.06885365,0.001103257,0.0001063075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000195688,0.00004136748,0.9936192,0.0005717765,0.005064058,0.0003927434,0.000003072518,0.00004081212,0.00007128163],"genre_scores_gemma":[0.04617784,0.00002558782,0.9516367,0.00009410567,0.002013602,0.00002161724,0.000007745248,0.00001200474,0.00001082617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8611861,"threshold_uncertainty_score":0.3594742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01381954223386258,"score_gpt":0.2585072634341832,"score_spread":0.2446877212003206,"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."}}