{"id":"W2042481350","doi":"10.1016/j.ins.2011.02.009","title":"New complexity results for the k-covers problem","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Vertex cover; Cover (algebra); Bounded function; Cardinality (data modeling); Combinatorics; Mathematics; Reduction (mathematics); Vertex (graph theory); Parameterized complexity; Time complexity; String (physics); Discrete mathematics; Set (abstract data type); Set cover problem; NP-complete; Graph; Computer science","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.003434936,0.002157962,0.002471519,0.004193197,0.002114562,0.007401161,0.003843298,0.003335123,0.01593795],"category_scores_gemma":[0.03189935,0.001055993,0.003097808,0.005337792,0.003754138,0.02001729,0.006083444,0.009351212,0.001916292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004054846,"about_ca_system_score_gemma":0.002087592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171391,"about_ca_topic_score_gemma":0.002002146,"domain_scores_codex":[0.9955895,0.0009913878,0.0002691267,0.0007683628,0.001866918,0.0005146667],"domain_scores_gemma":[0.9606086,0.0327781,0.001504231,0.002462218,0.001680173,0.0009666244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004499544,0.0003164557,0.002192313,0.0008872118,0.0001981023,0.0003576076,0.000443541,0.07633328,0.002411574,0.806116,0.03316693,0.07712702],"study_design_scores_gemma":[0.00004196145,0.00003639067,0.0005136429,0.00005387341,0.00004701154,0.0002089807,0.0000884449,0.1159946,0.0005366437,0.8772969,0.005146655,0.0000348725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08527886,0.01048103,0.8014371,0.01815185,0.001454489,0.000316191,0.00237025,0.0007714782,0.07973884],"genre_scores_gemma":[0.6396126,0.012165,0.2971626,0.004286138,0.00800045,0.001178709,0.005004466,0.001120065,0.03146988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01593795,"threshold_uncertainty_score":0.05331779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1345540655591279,"score_gpt":0.2963074091520994,"score_spread":0.1617533435929715,"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."}}