{"id":"W2051064851","doi":"10.1007/s00453-007-9146-y","title":"Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; University of Victoria; University of Waterloo","funders":"","keywords":"Algorithm; Theory of computation; Packing problems; Time complexity; Matching (statistics); Mathematics; Exponent; Dynamic programming; Set (abstract data type); Approximation algorithm; Combinatorics; Computer science; Mathematical optimization","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.00431656,0.003994491,0.003823163,0.003024165,0.001907723,0.006894243,0.006671759,0.004437863,0.03506356],"category_scores_gemma":[0.02836553,0.001862036,0.003864467,0.007222811,0.001979463,0.01524318,0.004304026,0.008355937,0.007668796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00483195,"about_ca_system_score_gemma":0.004770651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00689249,"about_ca_topic_score_gemma":0.01007202,"domain_scores_codex":[0.9948795,0.001520869,0.0002490019,0.001220965,0.001381027,0.0007485742],"domain_scores_gemma":[0.9854516,0.008762059,0.0007048466,0.003967794,0.000733223,0.0003803408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001818924,0.001306659,0.00137331,0.001136662,0.000298394,0.0001850281,0.0004690682,0.2661395,0.004417473,0.181057,0.06779418,0.4740038],"study_design_scores_gemma":[0.0005814257,0.000121071,0.0004205346,0.00009680232,0.0001340883,0.0001522207,0.0001337824,0.6659329,0.002152475,0.3168581,0.01337016,0.00004651221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02181289,0.00262125,0.9434234,0.002037177,0.0004944394,0.0003925566,0.0008931168,0.004909647,0.02341549],"genre_scores_gemma":[0.152934,0.001255056,0.826587,0.000791283,0.0005312507,0.0009856658,0.002961542,0.002248863,0.01170542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03506356,"threshold_uncertainty_score":0.1172993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01963313073124341,"score_gpt":0.2472852207945475,"score_spread":0.2276520900633041,"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."}}