{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","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.003530907,0.003368443,0.002694593,0.003218844,0.002442701,0.007959092,0.006354414,0.004331031,0.01034623],"category_scores_gemma":[0.02689593,0.00194058,0.003979444,0.007157277,0.003515933,0.01251064,0.004355549,0.008243607,0.001867594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006079181,"about_ca_system_score_gemma":0.002479064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003971525,"about_ca_topic_score_gemma":0.002612035,"domain_scores_codex":[0.9939227,0.001414027,0.0003647955,0.001490507,0.001704206,0.001103797],"domain_scores_gemma":[0.9792781,0.01560287,0.001259256,0.00238859,0.0008428048,0.0006283082],"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.00114272,0.0008846932,0.003336681,0.001462474,0.000347228,0.0002965914,0.0009659021,0.5053006,0.004554944,0.3311287,0.02696725,0.1236123],"study_design_scores_gemma":[0.0001472922,0.00007223445,0.0005489192,0.0001214538,0.00008386674,0.0002391649,0.0001638791,0.6395373,0.00171941,0.3505262,0.006805443,0.00003482712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08015478,0.006611415,0.8653235,0.006285199,0.0002983223,0.0003761626,0.001905477,0.002001995,0.03704321],"genre_scores_gemma":[0.5172083,0.007711952,0.4488488,0.002105589,0.00125591,0.001259088,0.005926514,0.001349952,0.01433388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01034623,"threshold_uncertainty_score":0.04410774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04104861257864342,"score_gpt":0.285998406091064,"score_spread":0.2449497935124205,"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."}}