{"id":"W2963142939","doi":"","title":"Tight Approximation Results for General Covering Integer Programs","year":2002,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Combinatorics; Linear programming relaxation; Multiplicative function; Mathematics; Approximation algorithm; Integer (computer science); Upper and lower bounds; Discrete mathematics; Multiplicity (mathematics); Binary logarithm; Cover (algebra); 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.007613633,0.002795404,0.003024579,0.002225802,0.001710227,0.005549054,0.004008541,0.002675246,0.01040215],"category_scores_gemma":[0.03154173,0.001382174,0.002822834,0.004295876,0.002863198,0.009182434,0.004446794,0.007573255,0.00165623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005175199,"about_ca_system_score_gemma":0.002233159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002740795,"about_ca_topic_score_gemma":0.002687001,"domain_scores_codex":[0.9927062,0.002145688,0.0002889431,0.001108002,0.002293123,0.001458041],"domain_scores_gemma":[0.9870051,0.009615066,0.0008040867,0.001529545,0.0006211261,0.0004249993],"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.0006523551,0.0005085964,0.001963613,0.000776469,0.0002306209,0.0002056319,0.0005099682,0.5249848,0.003154618,0.3714977,0.0117291,0.08378651],"study_design_scores_gemma":[0.00006520156,0.0001020906,0.0003413692,0.00009856452,0.00007476116,0.0001625691,0.0001059083,0.7785038,0.001108009,0.2131745,0.006244328,0.00001893143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03566747,0.005250976,0.9256208,0.002567648,0.0002543655,0.0001790139,0.0003134378,0.001121065,0.02902513],"genre_scores_gemma":[0.5208939,0.006270782,0.455962,0.001911412,0.00095633,0.0005954609,0.001586406,0.0009949059,0.01082877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01040215,"threshold_uncertainty_score":0.0402652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1159366505249522,"score_gpt":0.1844646451953971,"score_spread":0.06852799467044489,"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."}}