{"id":"https://openalex.org/W1993119087","doi":"https://doi.org/10.1137/s0097539796314240","title":"Improved Approximation Guarantees for Packing and Covering Integer Programs","display_name":"Improved Approximation Guarantees for Packing and Covering Integer Programs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1993119087","doi":"https://doi.org/10.1137/s0097539796314240","mag":"1993119087"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796314240","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796314240","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005118312"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3492,"has_fulltext":false,"cited_by_count":137,"citation_normalized_percentile":{"value":0.96527778,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"29","issue":"2","first_page":"648","last_page":"670"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.86466383934021},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8157899379730225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7152639627456665},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6507020592689514},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5686612129211426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5651670098304749},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5628993511199951},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4880717992782593},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.47242581844329834},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.46053293347358704},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4481448829174042},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4328475296497345},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.41618919372558594},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29916977882385254},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.196598082780838}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.86466383934021},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8157899379730225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7152639627456665},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6507020592689514},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5686612129211426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5651670098304749},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5628993511199951},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4880717992782593},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47242581844329834},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.46053293347358704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4481448829174042},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4328475296497345},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.41618919372558594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29916977882385254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.196598082780838},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539796314240","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796314240","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/39172","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/39172","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.5311","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5311","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1995/95-37.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W788200807","https://openalex.org/W1481156553","https://openalex.org/W1501644705","https://openalex.org/W1969665089","https://openalex.org/W2000566002","https://openalex.org/W2001911901","https://openalex.org/W2013652529","https://openalex.org/W2022191808","https://openalex.org/W2022671649","https://openalex.org/W2040924621","https://openalex.org/W2042587503","https://openalex.org/W2046554800","https://openalex.org/W2051671042","https://openalex.org/W2059453880","https://openalex.org/W2073127061","https://openalex.org/W2088402854","https://openalex.org/W2091968492","https://openalex.org/W2093321189","https://openalex.org/W2101622070","https://openalex.org/W2103012681","https://openalex.org/W2106198334","https://openalex.org/W2109333427","https://openalex.org/W2130956934","https://openalex.org/W2134422938","https://openalex.org/W2135424293","https://openalex.org/W2152221184","https://openalex.org/W2157054705","https://openalex.org/W2163322487","https://openalex.org/W2179016037","https://openalex.org/W2295428206","https://openalex.org/W2493844837","https://openalex.org/W3011766368","https://openalex.org/W3137557471","https://openalex.org/W3148765228","https://openalex.org/W4238472918"],"related_works":["https://openalex.org/W191748763","https://openalex.org/W2560694610","https://openalex.org/W2010520791","https://openalex.org/W107228333","https://openalex.org/W3087791475","https://openalex.org/W2950751115","https://openalex.org/W3174963230","https://openalex.org/W2000723919","https://openalex.org/W2046322208","https://openalex.org/W2042292124"],"abstract_inverted_index":{"Several":[0],"important":[1],"NP-hard":[2],"combinatorial":[3],"optimization":[4],"problems":[5],"can":[6],"be":[7],"posed":[8],"as":[9],"packing/covering":[10],"integer":[11,40],"programs;":[12],"the":[13,45],"randomized":[14,55],"rounding":[15,56],"technique":[16],"of":[17,37,54],"Raghavan":[18],"and":[19,43],"Thompson":[20],"is":[21],"a":[22,61],"powerful":[23],"tool":[24],"with":[25,71],"which":[26],"to":[27,49],"approximate":[28],"them":[29,70],"well.":[30],"We":[31],"present":[32],"one":[33],"elementary":[34],"unifying":[35],"property":[36],"all":[38],"these":[39],"linear":[41],"programs":[42],"use":[44],"FKG":[46],"correlation":[47],"inequality":[48],"derive":[50],"an":[51],"improved":[52],"analysis":[53],"on":[57],"them.":[58],"This":[59],"yields":[60],"pessimistic":[62],"estimator,":[63],"thus":[64],"presenting":[65],"deterministic":[66],"polynomial-time":[67],"algorithms":[68],"for":[69],"approximation":[72],"guarantees":[73],"that":[74],"are":[75],"significantly":[76],"better":[77],"than":[78],"those":[79],"known.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}