{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002024093,0.001627065,0.001756774,0.001253915,0.0008282425,0.003163593,0.002454038,0.001894418,0.006872394],"category_scores_gemma":[0.01813087,0.001189824,0.001205184,0.00298251,0.001270842,0.005604995,0.002628198,0.002704093,0.0006933556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002689035,"about_ca_system_score_gemma":0.001511086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003560377,"about_ca_topic_score_gemma":0.004552108,"domain_scores_codex":[0.9981187,0.0006321793,0.00007919387,0.00032673,0.000448069,0.0003950505],"domain_scores_gemma":[0.9890208,0.008437132,0.0007007133,0.001087781,0.0004147497,0.0003388211],"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.0005141372,0.000234507,0.002401654,0.0001934005,0.00005939628,0.0001671537,0.0002146978,0.8348523,0.001806181,0.07497461,0.005494493,0.07908741],"study_design_scores_gemma":[0.00002709739,0.00003880071,0.0001137885,0.00001349069,0.00001518313,0.00004261924,0.00004897928,0.9553906,0.0006711023,0.04282653,0.0008071791,0.000004758596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3632159,0.0009478929,0.6051235,0.001540957,0.0001727478,0.0001844988,0.000550328,0.001976638,0.02628764],"genre_scores_gemma":[0.74312,0.0004403358,0.2475112,0.0003006448,0.0001481169,0.0002460184,0.001080149,0.0006761284,0.006477285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006872394,"threshold_uncertainty_score":0.02299041,"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."}}