{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062642,0.0002094087,0.0002101753,0.0001251518,0.0001185198,0.0001328652,0.0001033624,0.0001320234,0.0000404808],"category_scores_gemma":[0.00001928844,0.0002084095,0.00005939571,0.0001522225,0.00003134899,0.0002566187,0.00002565092,0.0001784813,0.00001589727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003557833,"about_ca_system_score_gemma":0.000007652138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001283757,"about_ca_topic_score_gemma":0.00001113977,"domain_scores_codex":[0.9988176,0.000009621864,0.0003160361,0.0002455869,0.0001309158,0.0004801936],"domain_scores_gemma":[0.999393,0.0002208109,0.00004394986,0.0001676521,0.00005079317,0.0001237769],"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.00003820853,0.0001264715,0.0007380048,0.0009126547,0.0003319458,0.00001925114,0.006285457,0.09888449,0.01092352,0.001761,0.003085419,0.8768936],"study_design_scores_gemma":[0.00249756,0.0001959045,0.0008603611,0.0002746675,0.00009647023,0.0001213965,0.0004587883,0.8573437,0.01962355,0.008130377,0.1089759,0.001421313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01799005,0.0003670433,0.9768158,0.0001025837,0.0005994524,0.0005214321,0.00002498152,0.0004441936,0.003134466],"genre_scores_gemma":[0.6277224,0.00008687621,0.3700938,0.0002956998,0.0004214149,0.00007221799,0.00006532247,0.0001612904,0.001081014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8754722,"threshold_uncertainty_score":0.8498693,"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."}}