{"id":"https://openalex.org/W782508147","doi":"https://doi.org/10.4086/toc.2012.v008a024","title":"","display_name":"","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W782508147","doi":"https://doi.org/10.4086/toc.2012.v008a024","mag":"782508147"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2012.v008a024","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a024","pdf_url":"https://theoryofcomputing.org/articles/v008a024/v008a024.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v008a024/v008a024.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I4210123431","display_name":"A.S. Watson (Netherlands)","ror":"https://ror.org/030nx8440","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210123431"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Watson Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Watson Research Center","institution_ids":["https://openalex.org/I4210123431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009276272","display_name":"Nitish Korula","orcid":null},"institutions":[{"id":"https://openalex.org/I4210123431","display_name":"A.S. Watson (Netherlands)","ror":"https://ror.org/030nx8440","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210123431"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Nitish Korula","raw_affiliation_strings":["Watson Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Watson Research Center","institution_ids":["https://openalex.org/I4210123431"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I4210123431","display_name":"A.S. Watson (Netherlands)","ror":"https://ror.org/030nx8440","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210123431"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["Watson Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Watson Research Center","institution_ids":["https://openalex.org/I4210123431"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I4210123431","display_name":"A.S. Watson (Netherlands)","ror":"https://ror.org/030nx8440","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210123431"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["Watson Research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Watson Research Center","institution_ids":["https://openalex.org/I4210123431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210123431"],"apc_list":null,"apc_paid":null,"fwci":4.2834,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":{"value":0.94264877,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"8","issue":"1","first_page":"533","last_page":"565"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8523363471031189},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.8022769689559937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7467147707939148},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.603483259677887},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.571438729763031},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5620654821395874},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5587667226791382},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.540791928768158},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5407651662826538},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4646797776222229},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.4380044937133789},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41638848185539246},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14916667342185974}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8523363471031189},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.8022769689559937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7467147707939148},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.603483259677887},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.571438729763031},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5620654821395874},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5587667226791382},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.540791928768158},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5407651662826538},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4646797776222229},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4380044937133789},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41638848185539246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14916667342185974},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4086/toc.2012.v008a024","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a024","pdf_url":"https://theoryofcomputing.org/articles/v008a024/v008a024.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/3de03d8b-ae59-4c6f-9552-bd141cc66b42","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/3de03d8b-ae59-4c6f-9552-bd141cc66b42","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Korula, N, Nagarajan, V & Srinivasan, A 2012, 'Solving packing integer programs via randomized rounding with alterations', Theory of Computing, vol. 8, no. 24, pp. 533-565. https://doi.org/10.4086/toc.2012.v008a024","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/3de03d8b-ae59-4c6f-9552-bd141cc66b42","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/3de03d8b-ae59-4c6f-9552-bd141cc66b42","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory of Computing, 8(24), 533 - 565. University of Chicago","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.4086/toc.2012.v008a024","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2012.v008a024","pdf_url":"https://theoryofcomputing.org/articles/v008a024/v008a024.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7212731324","display_name":"Collaborative Research:  NeTS-NBD:  An Integrated Approach to Computing Capacity and Developing Efficient Cross-Layer Protocols for Wireless Networks","funder_award_id":"0626636","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G776067557","display_name":"ITR - (ASE+NHS) - (DMC+INT+SOC):    Resilient Storage and Querying in Decentralized Networks","funder_award_id":"0426683","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8911331200","display_name":"NetSE: Large: Collaborative Research: Contagion in Large Socio-Communication Networks","funder_award_id":"1010789","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332222","display_name":"University of Illinois at Urbana-Champaign","ror":"https://ror.org/047426m28"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W782508147.pdf","grobid_xml":"https://content.openalex.org/works/W782508147.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W123178497","https://openalex.org/W1482106463","https://openalex.org/W1491127810","https://openalex.org/W1506184069","https://openalex.org/W1680189815","https://openalex.org/W1809731507","https://openalex.org/W1883792619","https://openalex.org/W1966923282","https://openalex.org/W1971749164","https://openalex.org/W1989453388","https://openalex.org/W1991223607","https://openalex.org/W1993119087","https://openalex.org/W2005509629","https://openalex.org/W2014369282","https://openalex.org/W2025050335","https://openalex.org/W2043260929","https://openalex.org/W2062075466","https://openalex.org/W2063241141","https://openalex.org/W2063807274","https://openalex.org/W2064933851","https://openalex.org/W2068871408","https://openalex.org/W2081192873","https://openalex.org/W2089117840","https://openalex.org/W2120358419","https://openalex.org/W2132651631","https://openalex.org/W2140118062","https://openalex.org/W2140322654","https://openalex.org/W2160146903","https://openalex.org/W2166369652","https://openalex.org/W2405581430","https://openalex.org/W2610183793","https://openalex.org/W2757107770","https://openalex.org/W2951496501","https://openalex.org/W3011766368","https://openalex.org/W3100701976","https://openalex.org/W3124727707","https://openalex.org/W4247849388","https://openalex.org/W4248079359"],"related_works":["https://openalex.org/W2235694368","https://openalex.org/W2548642347","https://openalex.org/W4300592161","https://openalex.org/W2950198148","https://openalex.org/W4287322635","https://openalex.org/W3210745387","https://openalex.org/W3178236364","https://openalex.org/W1581948717","https://openalex.org/W2062310236","https://openalex.org/W2543175834"],"abstract_inverted_index":{"$":[0,3],"\\newcommand{\\eee}{\\mathrm":[1],"e}":[2],"We":[4,48,94,110],"give":[5,95],"new":[6,144],"approximation":[7,30],"algorithms":[8],"for":[9,32,63,100],"packing":[10,67,127],"integer":[11,68],"programs":[12,69],"(PIPs)":[13,70],"by":[14],"employing":[15],"the":[16,37,64,85,116,151],"method":[17],"of":[18,57,66,87,118,146,158],"randomized":[19],"rounding":[20],"combined":[21],"with":[22],"alterations.":[23],"Our":[24,59],"first":[25],"result":[26,61,114],"is":[27,62,78],"a":[28,54,79,143],"simpler":[29],"algorithm":[31,99],"general":[33],"PIPs":[34],"which":[35,42,155],"matches":[36],"best":[38],"known":[39,107],"bounds,":[40],"and":[41,129],"admits":[43],"an":[44,96,131],"efficient":[45],"parallel":[46],"implementation.":[47],"also":[49,111],"extend":[50],"these":[51],"results":[52],"to":[53,115],"multi-criteria":[55],"version":[56],"PIPs.":[58],"second":[60],"class":[65],"that":[71,89,149],"are":[72],"column":[73],"sparse,":[74],"i.e.,":[75],"where":[76],"there":[77],"specified":[80],"upper":[81],"bound":[82],"$k$":[83],"on":[84],"number":[86],"constraints":[88],"each":[90],"variable":[91],"appears":[92],"in.":[93],"$(\\eee":[97],"k+o(k))$-approximation":[98],"$k$-column":[101,125],"sparse":[102,126],"PIPs,":[103],"improving":[104],"over":[105,124],"previously":[106],"$O(k^2)$-approximation":[108],"ratios.":[109],"generalize":[112],"our":[113],"case":[117],"maximizing":[119],"non-negative":[120],"monotone":[121],"submodular":[122,147],"functions":[123,148],"constraints,":[128],"obtain":[130],"$\\smash{\\left(\\frac{\\eee^2k}{\\eee-1}":[132],"+":[133],"o(k)":[134],"\\right)}$-approximation":[135],"algorithm.":[136],"In":[137],"obtaining":[138],"this":[139],"result,":[140],"we":[141],"prove":[142],"property":[145],"generalizes":[150],"fractional":[152],"subadditivity":[153],"property,":[154],"might":[156],"be":[157],"independent":[159],"interest.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2016-06-24T00:00:00"}