Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a variety of packing-type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we d...
Saved in:
| Published in: | SIAM journal on computing Vol. 43; no. 6; pp. 1831 - 1879 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.01.2014
|
| Subjects: | |
| ISSN: | 0097-5397, 1095-7111 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a variety of packing-type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we develop a general framework that allows us to derive a number of new results, in particular, when $f$ may be a nonmonotone function. Our algorithms are based on (approximately) maximizing the multilinear extension $F$ of $f$ over a polytope $P$ that represents the constraints, and then effectively rounding the fractional solution. Although this approach has been used quite successfully, it has been limited in some important ways. We overcome these limitations as follows. First, we give constant factor approximation algorithms to maximize $F$ over a downward-closed polytope $P$ described by an efficient separation oracle. Previously this was known only for monotone functions. For nonmonotone functions, a constant factor was known only when the polytope was either the intersection of a fixed number of knapsack constraints or a matroid polytope. Second, we show that contention resolution schemes are an effective way to round a fractional solution, even when $f$ is nonmonotone. In particular, contention resolution schemes for different polytopes can be combined to handle the intersection of different constraints. Via linear programming duality we show that a contention resolution scheme for a constraint is related to the correlation gap of weighted rank functions of the constraint. This leads to an optimal contention resolution scheme for the matroid polytope. Our results provide a broadly applicable framework for maximizing linear and submodular functions subject to independence constraints. We give several illustrative examples. Contention resolution schemes may find other applications. |
|---|---|
| AbstractList | We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a variety of packing-type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we develop a general framework that allows us to derive a number of new results, in particular, when $f$ may be a nonmonotone function. Our algorithms are based on (approximately) maximizing the multilinear extension $F$ of $f$ over a polytope $P$ that represents the constraints, and then effectively rounding the fractional solution. Although this approach has been used quite successfully, it has been limited in some important ways. We overcome these limitations as follows. First, we give constant factor approximation algorithms to maximize $F$ over a downward-closed polytope $P$ described by an efficient separation oracle. Previously this was known only for monotone functions. For nonmonotone functions, a constant factor was known only when the polytope was either the intersection of a fixed number of knapsack constraints or a matroid polytope. Second, we show that contention resolution schemes are an effective way to round a fractional solution, even when $f$ is nonmonotone. In particular, contention resolution schemes for different polytopes can be combined to handle the intersection of different constraints. Via linear programming duality we show that a contention resolution scheme for a constraint is related to the correlation gap of weighted rank functions of the constraint. This leads to an optimal contention resolution scheme for the matroid polytope. Our results provide a broadly applicable framework for maximizing linear and submodular functions subject to independence constraints. We give several illustrative examples. Contention resolution schemes may find other applications. |
| Author | Chekuri, Chandra Vondrák, Jan Zenklusen, Rico |
| Author_xml | – sequence: 1 givenname: Chandra surname: Chekuri fullname: Chekuri, Chandra – sequence: 2 givenname: Jan surname: Vondrák fullname: Vondrák, Jan – sequence: 3 givenname: Rico surname: Zenklusen fullname: Zenklusen, Rico |
| BookMark | eNptkFFLwzAUhYNMcJs--A_6qA91SdM2zaMMp8KGsOlzSZMbFkmT2aQy_fXWTXwQn-493O9cOGeCRs47QOiS4BtCKJsRgivKy6I4QWOCeZEyQsgIjTHmLC0oZ2doEsIrxiTPCR0jsemb1qveii5Z9E5G412yEnvTmk9xEO9GJHELyaq30VjjYCDXYMX-eBZOJXPvIriDXEPwtj-sG7mFFsI5OtXCBrj4mVP0srh7nj-ky6f7x_ntMpU0q2JKmQbOZSErxZtcZxprSpXCpCIZ5GUFWkIDCspM50w2KudFVTZlDoMvUxWlU3R1_Lvr_FsPIdatCRKsFQ58H2pSFoTyjGE2oNdHVHY-hA50vetMK7qPmuD6u8b6t8aBnf1hpYmH6LETxv7j-AIhyHfj |
| CitedBy_id | crossref_primary_10_1007_s00224_021_10065_6 crossref_primary_10_1016_j_tcs_2021_02_035 crossref_primary_10_1287_moor_2018_0955 crossref_primary_10_1007_s10107_017_1154_3 crossref_primary_10_1007_s10107_017_1218_4 crossref_primary_10_1109_LRA_2019_2925301 crossref_primary_10_1137_21M1411822 crossref_primary_10_1145_3355400 crossref_primary_10_1109_TPDS_2022_3186960 crossref_primary_10_1007_s10107_020_01524_y crossref_primary_10_1137_20M1357317 crossref_primary_10_1155_2018_2609471 crossref_primary_10_1287_ijoo_2019_0041 crossref_primary_10_1007_s10107_024_02178_w crossref_primary_10_1007_s10107_020_01570_6 crossref_primary_10_1007_s00453_020_00786_4 crossref_primary_10_1007_s10107_021_01620_7 crossref_primary_10_1007_s00453_019_00628_y crossref_primary_10_1137_19M1304271 crossref_primary_10_1287_moor_2023_1388 crossref_primary_10_1016_j_ipl_2020_106010 crossref_primary_10_1007_s10107_025_02211_6 crossref_primary_10_1137_16M1105220 crossref_primary_10_1137_24M1630207 crossref_primary_10_1016_j_tcs_2022_10_042 crossref_primary_10_1145_3381329_3381334 crossref_primary_10_3390_math13091447 crossref_primary_10_1145_3070685 crossref_primary_10_1287_opre_2022_2370 crossref_primary_10_1007_s11590_021_01795_0 crossref_primary_10_1137_130906830 crossref_primary_10_1016_j_orl_2018_11_002 crossref_primary_10_1145_3381525 crossref_primary_10_1287_opre_2022_0309 crossref_primary_10_1287_moor_2021_1208 crossref_primary_10_1016_j_orl_2018_10_004 crossref_primary_10_1007_s10878_023_01021_w crossref_primary_10_1007_s10898_021_01123_x crossref_primary_10_1007_s00453_020_00757_9 crossref_primary_10_1007_s10878_024_01232_9 crossref_primary_10_1287_moor_2021_1152 crossref_primary_10_1007_s10878_022_00914_6 crossref_primary_10_1007_s10898_022_01193_5 crossref_primary_10_1109_TNSE_2024_3397188 crossref_primary_10_1137_18M1226130 crossref_primary_10_1016_j_automatica_2023_111000 crossref_primary_10_1007_s10107_024_02116_w crossref_primary_10_1287_moor_2015_0766 crossref_primary_10_1287_moor_2018_0965 crossref_primary_10_1016_j_tcs_2022_09_030 crossref_primary_10_1287_opre_2023_0339 crossref_primary_10_1007_s10107_020_01472_7 crossref_primary_10_1016_j_orl_2025_107255 crossref_primary_10_1007_s10107_025_02253_w crossref_primary_10_1007_s10878_019_00470_6 crossref_primary_10_1109_TMC_2018_2831690 crossref_primary_10_1145_3699824_3699837 crossref_primary_10_1007_s00453_023_01195_z crossref_primary_10_1007_s10878_024_01193_z crossref_primary_10_1287_moor_2021_1224 crossref_primary_10_1007_s40305_015_0116_9 |
| Cites_doi | 10.1287/moor.2013.0592 10.1023/B:JOCO.0000038913.96607.c2 10.4086/toc.2012.v008a024 10.1007/s00453-006-1210-5 10.1287/mnsc.23.8.789 10.4086/toc.2010.v006a011 10.1137/090750020 10.1145/1273340.1273343 10.1145/285055.285059 10.1007/s00454-012-9417-5 10.1016/S0167-6377(03)00062-2 10.1287/moor.1100.0463 10.1137/11083232X 10.1287/moor.3.3.177 10.1007/BFb0121195 10.1007/s10107-002-0370-6 10.1137/090779346 10.1137/080733991 10.1007/BF02523685 10.1016/0377-2217(84)90053-5 10.1137/110832318 10.1016/0304-3975(76)90048-7 10.1145/2000807.2000816 10.1287/opre.1110.1011 10.1007/BF02392825 10.1007/BF01588971 10.1145/1993636.1993740 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1137/110839655 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1095-7111 |
| EndPage | 1879 |
| ExternalDocumentID | 10_1137_110839655 |
| GroupedDBID | --Z -DZ -~X .4S .DC 123 4.4 7RQ 7WY 7X2 7XC 88I 8CJ 8FE 8FG 8FH 8FL 8G5 8V8 AALVN AASXH AAYXX ABDBF ABDPE ABJCF ABKAD ABMZU ABPPZ ABUFD ABUWG ACBEA ACGFO ACGOD ACIWK ACNCT ACPRK ACUHS ADBBV ADMHC ADXHL AEMOZ AENEX AFFHD AFKRA AFRAH AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU CITATION CS3 CZ9 D1I D1J D1K DQ2 DU5 DWQXO EAP EAS EBR EBS EBU ECS EDO EJD EMK EST ESX FRNLG GNUQQ GUQSH H13 HCIFZ H~9 I-F K1G K6- K60 K6V K6~ K7- KB. KC. L6V LK5 LK8 M0C M0K M1Q M2O M2P M7P M7R M7S MK~ NHB OHT P1Q P2P P62 PATMY PDBOC PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PTHSS PYCSY RJG RNS RSI S0W TAE TH9 TN5 TUS TWZ UHB UQL VOH WH7 WHG XJE YNT YYP YZZ ZCG ZY4 7SC 8FD JQ2 L7M L~C L~D PUEGO |
| ID | FETCH-LOGICAL-c328t-37fe99c5c8d9b4f2f0f33dd01812e468efcebede62f47cbd49586b64e7fe2d833 |
| ISICitedReferencesCount | 153 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000346845600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0097-5397 |
| IngestDate | Thu Sep 04 17:53:52 EDT 2025 Sat Nov 29 07:56:10 EST 2025 Tue Nov 18 22:42:33 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c328t-37fe99c5c8d9b4f2f0f33dd01812e468efcebede62f47cbd49586b64e7fe2d833 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1651392707 |
| PQPubID | 23500 |
| PageCount | 49 |
| ParticipantIDs | proquest_miscellaneous_1651392707 crossref_primary_10_1137_110839655 crossref_citationtrail_10_1137_110839655 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-01-00 20140101 |
| PublicationDateYYYYMMDD | 2014-01-01 |
| PublicationDate_xml | – month: 01 year: 2014 text: 2014-01-00 |
| PublicationDecade | 2010 |
| PublicationTitle | SIAM journal on computing |
| PublicationYear | 2014 |
| References | atypb9 atypb8 Chekuri C. (atypb13) 2009 Oveis Gharan S. (atypb42) 2011 atypb19 Kulik A. (atypb33) 2009 Yan Q. (atypb49) 2011 atypb26 atypb48 atypb22 atypb44 atypb24 atypb25 atypb40 atypb41 atypb20 Srinivasan A. (atypb43) 2001 Chekuri C. (atypb16) 2011 Ene A. (atypb18) 2012 Calinescu G. (atypb6) 2007 atypb37 atypb17 atypb34 atypb35 atypb14 atypb36 atypb1 atypb30 atypb31 atypb2 atypb10 atypb5 atypb4 Lovász L. (atypb38) 1983 atypb7 |
| References_xml | – ident: atypb34 doi: 10.1287/moor.2013.0592 – start-page: 545 year: 2009 ident: atypb33 publication-title: Philadelphia – ident: atypb1 doi: 10.1023/B:JOCO.0000038913.96607.c2 – ident: atypb4 doi: 10.4086/toc.2012.v008a024 – ident: atypb8 doi: 10.1007/s00453-006-1210-5 – ident: atypb17 doi: 10.1287/mnsc.23.8.789 – ident: atypb22 doi: 10.4086/toc.2010.v006a011 – ident: atypb35 doi: 10.1137/090750020 – ident: atypb14 doi: 10.1145/1273340.1273343 – ident: atypb19 doi: 10.1145/285055.285059 – ident: atypb9 doi: 10.1007/s00454-012-9417-5 – ident: atypb44 doi: 10.1016/S0167-6377(03)00062-2 – ident: atypb36 doi: 10.1287/moor.1100.0463 – ident: atypb37 doi: 10.1137/11083232X – start-page: 42 year: 2009 ident: atypb13 publication-title: Heidelberg – ident: atypb40 doi: 10.1287/moor.3.3.177 – ident: atypb24 doi: 10.1007/BFb0121195 – ident: atypb31 doi: 10.1007/s10107-002-0370-6 – ident: atypb20 doi: 10.1137/090779346 – ident: atypb7 doi: 10.1137/080733991 – ident: atypb26 doi: 10.1007/BF02523685 – start-page: 235 year: 1983 ident: atypb38 publication-title: Berlin – ident: atypb25 doi: 10.1016/0377-2217(84)90053-5 – ident: atypb48 doi: 10.1137/110832318 – ident: atypb10 doi: 10.1016/0304-3975(76)90048-7 – ident: atypb5 doi: 10.1145/2000807.2000816 – start-page: 1098 year: 2011 ident: atypb42 publication-title: Philadelphia – ident: atypb2 doi: 10.1287/opre.1110.1011 – ident: atypb30 doi: 10.1007/BF02392825 – ident: atypb41 doi: 10.1007/BF01588971 – start-page: 783 year: 2011 ident: atypb16 publication-title: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing doi: 10.1145/1993636.1993740 – start-page: 11 year: 2012 ident: atypb18 publication-title: New York – start-page: 710 year: 2011 ident: atypb49 publication-title: Philadelphia – start-page: 182 year: 2007 ident: atypb6 publication-title: Berlin – start-page: 567 year: 2001 ident: atypb43 publication-title: Philadelphia |
| SSID | ssj0014413 |
| Score | 2.5370119 |
| Snippet | We consider the problem of maximizing a nonnegative submodular set function $f:2 perpendicular \rightarrow {\mathbb R}_+$ over a ground set $N$ subject to a... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 1831 |
| SubjectTerms | Algorithms Approximation Constants Intersections Mathematical analysis Mathematical models Maximization Polytopes |
| Title | Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes |
| URI | https://www.proquest.com/docview/1651392707 |
| Volume | 43 |
| WOSCitedRecordID | wos000346845600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7WY dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0C dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: P5Z dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Agriculture Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M0K dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/agriculturejournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7P dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Career & Technical Education Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: 7RQ dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/career providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: K7- dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M7S dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Environmental Science Database (subscripiton) customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: PATMY dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/environmentalscience providerName: ProQuest – providerCode: PRVPQU databaseName: Materials Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: KB. dateStart: 19720301 isFulltext: true titleUrlDefault: http://search.proquest.com/materialsscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M1Q dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central - New (Subscription) customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: BENPR dateStart: 19720301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Research Library customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2O dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1095-7111 dateEnd: 20140531 omitProxy: false ssIdentifier: ssj0014413 issn: 0097-5397 databaseCode: M2P dateStart: 19720301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9pAEF6RpIf20EfaqukDbauqqlQ5xY_dtY9JBGoVIJSQlOZimfWuhCCG8hJS_3xnH34g5ZAeehlhs8bg-ZiZ3Z35BqGPfiAj6TVSR_J05AQ0EU5Cfe6QkaRCRK4ndNO-6zbrdsPhMOrVan_yWpjNlGVZuN1G8_-qajgHylals_-g7uJD4QS8BqWDBLWDvJfiwRTczlKdXdoCp6X120m241tbcfllM050uKlrb1WUCSNVTtzWvK1W0jVnlcmDVOv75usqxk6RF4zYePby-0mnZJ8wKe3rVe4OddqAmKxNNbsqZEgXhRu4nqmjiUnVLSB6I7LJNF8W6gNMq8sSblBZlrCmNmIO8U3y7bEw1hXiOYfl1tWaX8PSZGFWtaVgbNyKX1Zt0e-2-YY1wIVgMqKG83eXV7t7Ebeu2u140BwOPs1_O6rlmNqat_1X9tCBx0ikTOL56XGxBQVxoqUwNb_D0lLB3b4W99oNZnZ9uQ5QBk_RYzuzwCcGEc9QTWSH6EnetQNbI36IHnUKpt7lc5SUcME5XHAVLhjgguECXIELLuGCQae4hAsu4YItXF6gq1ZzcPbNsW03HO574QpcjhRRxAkP02gUSE82pO-nqWZ2EwENheTwz08F9WTA-CiFKXZIRzQQcJ2Xhr7_Eu1ns0y8QpgRSbjLqCRUEVEqYiNXwBOVhHAwEukR-pw_v5hbTnrVGmUa67mpz-LiUR-hD8XQuSFiuWvQ-1wJMZhJtfeVZGK2XsYuJTDX8ViDvb7HmDfoYYnpt2h_tViLd-gB36zGy0Ud7bH-DyV__qqjg9Nmt9eHo3Pm1DWCQHYaZ1qeK-mqsR3vQsuekszIS5A9cvMXtmCZ3g |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Submodular+Function+Maximization+via+the+Multilinear+Relaxation+and+Contention+Resolution+Schemes&rft.jtitle=SIAM+journal+on+computing&rft.au=Chekuri%2C+Chandra&rft.au=Vondrak%2C+Jan&rft.au=Zenklusen%2C+Rico&rft.date=2014-01-01&rft.issn=0097-5397&rft.eissn=1095-7111&rft.volume=43&rft.issue=6&rft.spage=1831&rft.epage=1879&rft_id=info:doi/10.1137%2F110839655&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0097-5397&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0097-5397&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0097-5397&client=summon |