{"id":"W2109533535","doi":"10.1109/sfcs.2001.959928","title":"Tight approximation results for general covering integer programs","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Linear programming relaxation; Rounding; Multiplicative function; Approximation algorithm; Mathematics; Upper and lower bounds; Integer (computer science); Randomized rounding; Discrete mathematics; Cover (algebra); Binary logarithm; Multiplicity (mathematics); Linear programming; Algorithm; 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.005705136,0.002583004,0.002839415,0.001929926,0.001569713,0.00454464,0.004136028,0.00278816,0.01038804],"category_scores_gemma":[0.02597318,0.001375436,0.002731397,0.004175477,0.002768021,0.008113243,0.0037306,0.006241365,0.001764952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004491955,"about_ca_system_score_gemma":0.001996252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002983816,"about_ca_topic_score_gemma":0.00268301,"domain_scores_codex":[0.9940408,0.001598944,0.0002296819,0.001176463,0.001731509,0.001222631],"domain_scores_gemma":[0.9905707,0.006816849,0.0006062941,0.001101081,0.0005231619,0.0003820011],"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.0006559449,0.0005197921,0.001975392,0.0007683715,0.0002124726,0.0002636898,0.0005816607,0.5747842,0.003208142,0.2910761,0.01636633,0.1095879],"study_design_scores_gemma":[0.00006983378,0.0001017126,0.000284186,0.00007129241,0.0000598049,0.0001736727,0.0001071868,0.8463101,0.0009626913,0.1448761,0.006967042,0.00001623608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03557087,0.004319563,0.9252396,0.002603069,0.0002604208,0.0002084632,0.0003252563,0.001585772,0.0298869],"genre_scores_gemma":[0.4354867,0.004959482,0.5444295,0.00177941,0.0007288335,0.0005903222,0.001596349,0.0009979765,0.009431366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01038804,"threshold_uncertainty_score":0.03475147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04364182730979306,"score_gpt":0.270655222080916,"score_spread":0.227013394771123,"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."}}