{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095156,0.001904321,0.002415342,0.001951399,0.001292638,0.002563009,0.004551685,0.002514564,0.01360954],"category_scores_gemma":[0.005447556,0.0009171753,0.001657647,0.00350954,0.0007966308,0.004201587,0.002943637,0.003244803,0.002609076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002583619,"about_ca_system_score_gemma":0.003854671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007412937,"about_ca_topic_score_gemma":0.01091333,"domain_scores_codex":[0.9986351,0.0002642126,0.00006988783,0.00031703,0.000420281,0.0002934675],"domain_scores_gemma":[0.9978718,0.001066735,0.0001378943,0.0004764489,0.0002746227,0.0001725169],"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.001625833,0.001022303,0.001910647,0.0006051971,0.0001952992,0.0002408361,0.0003518948,0.3959942,0.008471934,0.03935502,0.03520943,0.5150174],"study_design_scores_gemma":[0.0002719761,0.0001354779,0.0004110608,0.000030766,0.0000573941,0.0001510654,0.00008032042,0.9662437,0.001333506,0.02714484,0.004117276,0.00002264479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06413227,0.001140345,0.9122375,0.001270187,0.0003893454,0.0005140658,0.001068733,0.003606396,0.01564115],"genre_scores_gemma":[0.1757721,0.0004183947,0.8145596,0.0003788037,0.0001716926,0.0004991542,0.002340615,0.0004185284,0.005441273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01360954,"threshold_uncertainty_score":0.04552841,"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."}}