{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7464","name":"Knapsack Cover Subject to a Matroid Constraint","abstract":"We consider the Knapsack Covering problem subject to a matroid constraint. In this problem, we are given an universe U of n items where item i has attributes: a cost c(i) and a size s(i). We also have a demand D. We are also given a matroid M = (U, I) on the set U. A feasible solution S to the problem is one such that (i) the cumulative size of the items chosen is at least D, and (ii) the set S is independent in the matroid M (i.e. S is in I). The objective is to minimize the total cost of the items selected, sum_{i in S}c(i). \r\nOur main result proves a 2-factor approximation for this problem. \r\n\r\nThe problem described above falls in the realm of mixed packing covering problems. We also consider packing extensions of certain other covering problems and prove that in such cases it is not possible to derive any constant factor pproximations.","keywords":["Approximation Algorithms","LP rounding","Matroid Constraints","Knapsack problems"],"author":[{"@type":"Person","name":"Chakaravarthy, Venkatesan T.","givenName":"Venkatesan T.","familyName":"Chakaravarthy"},{"@type":"Person","name":"Choudhury, Anamitra Roy","givenName":"Anamitra Roy","familyName":"Choudhury"},{"@type":"Person","name":"Natarajan, Sivaramakrishnan R.","givenName":"Sivaramakrishnan R.","familyName":"Natarajan"},{"@type":"Person","name":"Roy, Sambuddha","givenName":"Sambuddha","familyName":"Roy"}],"position":25,"pageStart":275,"pageEnd":286,"dateCreated":"2013-12-10","datePublished":"2013-12-10","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Chakaravarthy, Venkatesan T.","givenName":"Venkatesan T.","familyName":"Chakaravarthy"},{"@type":"Person","name":"Choudhury, Anamitra Roy","givenName":"Anamitra Roy","familyName":"Choudhury"},{"@type":"Person","name":"Natarajan, Sivaramakrishnan R.","givenName":"Sivaramakrishnan R.","familyName":"Natarajan"},{"@type":"Person","name":"Roy, Sambuddha","givenName":"Sambuddha","familyName":"Roy"}],"copyrightYear":"2013","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2013.275","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6227","volumeNumber":24,"name":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)","dateCreated":"2013-12-10","datePublished":"2013-12-10","editor":[{"@type":"Person","name":"Seth, Anil","givenName":"Anil","familyName":"Seth"},{"@type":"Person","name":"Vishnoi, Nisheeth K.","givenName":"Nisheeth K.","familyName":"Vishnoi"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7464","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6227"}}}