{"id":"W4416091488","doi":"10.1016/j.ic.2025.105378","title":"Approximation algorithms for the maximum path cover problem using long paths","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Research Grants Council, University Grants Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Approximation algorithm; Path (computing); Cover (algebra); Matching (statistics); Approximation theory; Stability (learning theory)","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.00124921,0.001596934,0.001539063,0.001625644,0.001170386,0.00180677,0.002952926,0.001850452,0.005668368],"category_scores_gemma":[0.007079264,0.000836913,0.001344354,0.003800092,0.0008381308,0.00541265,0.002324764,0.00206888,0.001050455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002511418,"about_ca_system_score_gemma":0.001726125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00497609,"about_ca_topic_score_gemma":0.005442983,"domain_scores_codex":[0.9983284,0.0003742786,0.00008007362,0.000438675,0.0003856331,0.0003929281],"domain_scores_gemma":[0.9971782,0.001831787,0.0002740518,0.0004165462,0.0001513152,0.0001481803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009106859,0.0003809153,0.001643092,0.0006251417,0.0001722496,0.0002599754,0.0004357638,0.7237425,0.004892848,0.04980725,0.01491856,0.202211],"study_design_scores_gemma":[0.0001399805,0.00009675089,0.0002674692,0.00004314252,0.00003514798,0.0001903172,0.00007568975,0.9266437,0.001499337,0.06761166,0.003379056,0.00001786025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09114905,0.002474414,0.8913276,0.001085391,0.0001150847,0.0002842312,0.00085692,0.002975881,0.009731424],"genre_scores_gemma":[0.477894,0.001271175,0.5114144,0.0002894608,0.0001485777,0.000522349,0.002637023,0.0005275168,0.005295605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005668368,"threshold_uncertainty_score":0.01896262,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0260570322112164,"score_gpt":0.279263361594758,"score_spread":0.2532063293835415,"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."}}