{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7593","name":"Constrained Monotone Function Maximization and the Supermodular Degree","abstract":"The problem of maximizing a constrained monotone set function has many practical applications and generalizes many combinatorial problems such as k-Coverage, Max-SAT, Set Packing, Maximum Independent Set and Welfare Maximization. Unfortunately, it is generally not possible to maximize a monotone set function up to an acceptable approximation ratio, even subject to simple constraints. One highly studied approach to cope with this hardness is to restrict the set function, for example, by requiring it to be submodular. An outstanding disadvantage of imposing such a restriction on the set function is that no result is implied for set functions deviating from the restriction, even slightly. A more flexible approach, studied by Feige and Izsak [ITCS 2013], is to design an approximation algorithm whose approximation ratio depends on the complexity of the instance, as measured by some complexity measure. Specifically, they introduced a complexity measure called supermodular degree, measuring deviation from submodularity, and designed an algorithm for the welfare maximization problem with an approximation ratio that depends on this measure. \r\n\r\nIn this work, we give the first (to the best of our knowledge) algorithm for maximizing an arbitrary monotone set function, subject to a k-extendible system. This class of constraints captures, for example, the intersection of k-matroids (note that a single matroid constraint is sufficient to capture the welfare maximization problem).\r\nOur approximation ratio deteriorates gracefully with the complexity of the set function and k. Our work can be seen as generalizing both the classic result of Fisher, Nemhauser and Wolsey [Mathematical Programming Study 1978], for maximizing a submodular set function subject to a k-extendible system, and the result of Feige and Izsak for the welfare maximization problem. Moreover, when our algorithm is applied to each one of these simpler cases, it obtains the same approximation ratio as of the respective original work. That is, the generalization does not incur any penalty. Finally, we also consider the less general problem of maximizing a monotone set function subject to a uniform matroid constraint, and give a somewhat better approximation ratio for it.","keywords":["supermodular degree","set function","submodular","matroid","extendible system"],"author":[{"@type":"Person","name":"Feldman, Moran","givenName":"Moran","familyName":"Feldman"},{"@type":"Person","name":"Izsak, Rani","givenName":"Rani","familyName":"Izsak"}],"position":12,"pageStart":160,"pageEnd":175,"dateCreated":"2014-09-04","datePublished":"2014-09-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Feldman, Moran","givenName":"Moran","familyName":"Feldman"},{"@type":"Person","name":"Izsak, Rani","givenName":"Rani","familyName":"Izsak"}],"copyrightYear":"2014","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.160","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6231","volumeNumber":28,"name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014)","dateCreated":"2014-09-04","datePublished":"2014-09-04","editor":[{"@type":"Person","name":"Jansen, Klaus","givenName":"Klaus","familyName":"Jansen"},{"@type":"Person","name":"Rolim, Jos\u00e9","givenName":"Jos\u00e9","familyName":"Rolim"},{"@type":"Person","name":"Devanur, Nikhil R.","givenName":"Nikhil R.","familyName":"Devanur"},{"@type":"Person","name":"Moore, Cristopher","givenName":"Cristopher","familyName":"Moore"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7593","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":"#volume6231"}}}