{"id":"W2093259407","doi":"10.1016/s0166-218x(02)00598-x","title":"Approximating covering integer programs with multiplicity constraints","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplicity (mathematics); Multiplicative function; Mathematics; Row and column spaces; Integer (computer science); Combinatorics; Linear programming relaxation; Discrete mathematics; Row; Integer programming; Mathematical optimization; Mathematical analysis; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003967466,0.0002557711,0.0003072137,0.00006487677,0.0002054686,0.000265525,0.0006046424,0.00006180106,0.00001925808],"category_scores_gemma":[0.00004109479,0.0002011527,0.00006803861,0.0004115716,0.0002493942,0.0001920552,0.0001713355,0.0002335507,0.0000289469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002909772,"about_ca_system_score_gemma":0.00004379989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002728698,"about_ca_topic_score_gemma":0.000003523524,"domain_scores_codex":[0.9984316,0.00001817629,0.0003628439,0.0004002677,0.0003652265,0.0004219132],"domain_scores_gemma":[0.9988561,0.0001308864,0.0001952468,0.000660264,0.00004146366,0.0001159965],"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.00000191458,0.0001318501,0.00004447685,0.0001233136,0.00003360134,0.000007819571,0.002553259,0.0000709576,0.0002941372,0.9811404,0.000006072115,0.01559214],"study_design_scores_gemma":[0.002439176,0.0002351047,0.00009984506,0.0005315922,0.00006322423,0.0003288586,0.004263282,0.286263,0.01612463,0.6864318,0.001373432,0.001846046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01264583,0.000009593461,0.9439188,0.00002826433,0.00005197666,0.0005075649,0.000002118589,0.0003084445,0.04252744],"genre_scores_gemma":[0.4701184,7.614559e-7,0.529741,0.00004029048,0.00000955236,0.00006172082,0.000002309475,0.00001334706,0.00001253203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4574726,"threshold_uncertainty_score":0.8202767,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02111996281326427,"score_gpt":0.2295895729394317,"score_spread":0.2084696101261674,"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."}}