{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000219468,0.00008485893,0.00008423375,0.00005970407,0.000112527,0.0001885935,0.0004202333,0.00003394536,0.000005728497],"category_scores_gemma":[0.00002055196,0.00007130919,0.00006556684,0.0002793934,0.00002478911,0.0003894057,0.0001154021,0.00005433716,0.00001454609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001990067,"about_ca_system_score_gemma":0.00001576595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002885285,"about_ca_topic_score_gemma":0.00002217872,"domain_scores_codex":[0.9991813,0.00001371197,0.000181046,0.0002712058,0.0001368043,0.000215931],"domain_scores_gemma":[0.9995081,0.00004013842,0.0000449791,0.0003055301,0.00005207355,0.00004912921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002507918,0.0001002164,0.0001025697,0.00001177314,0.0000114972,0.000003399066,0.0004155812,0.0001045019,0.0001048762,0.6461326,0.001706015,0.3512819],"study_design_scores_gemma":[0.000682162,0.0001326113,0.0004930237,0.00001508241,0.000002283956,0.00001654324,0.00001168204,0.818126,0.001178446,0.08174228,0.09741353,0.0001863668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00705148,0.0000140743,0.9776914,0.000963674,0.0003145363,0.0002763744,0.00000164014,0.0002563227,0.0134305],"genre_scores_gemma":[0.149547,0.000007723786,0.8467845,0.0003204066,0.0002276789,0.00008276651,0.00002649312,0.000007130986,0.00299631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8180215,"threshold_uncertainty_score":0.2907905,"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."}}