| dc.contributor.author | Ward, J | en_US |
| dc.contributor.author | Zivny, S | en_US |
| dc.date.accessioned | 2017-09-01T15:15:36Z | |
| dc.date.issued | 2016 | en_US |
| dc.date.submitted | 2017-08-22T15:53:28.351Z | |
| dc.identifier.other | 4 | en_US |
| dc.identifier.other | 4 | en_US |
| dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/25586 | |
| dc.description | bibsource: dblp computer science bibliography, http://dblp.org biburl: http://dblp.org/rec/bib/journals/talg/WardZ16 timestamp: Tue, 03 Jan 2017 00:00:00 +0100 bdsk-url-1: http://doi.acm.org/10.1145/2850419 bdsk-url-2: http://dx.doi.org/10.1145/2850419 | en_US |
| dc.description | bibsource: dblp computer science bibliography, http://dblp.org biburl: http://dblp.org/rec/bib/journals/talg/WardZ16 timestamp: Tue, 03 Jan 2017 00:00:00 +0100 bdsk-url-1: http://doi.acm.org/10.1145/2850419 bdsk-url-2: http://dx.doi.org/10.1145/2850419 | en_US |
| dc.format.extent | 47:1 - 47:26 | en_US |
| dc.relation.ispartof | ACM Trans. Algorithms | en_US |
| dc.rights | This is a pre-copyedited, author-produced version of an article accepted for publication in ACM Transactions on Algorithms following peer review. The version of record is available http://dl.acm.org/citation.cfm?doid=2983296.2850419 | |
| dc.title | Maximizing k-Submodular Functions and Beyond | en_US |
| dc.type | Article | |
| dc.rights.holder | © 2017 ACM, Inc. | |
| dc.identifier.doi | 10.1145/2850419 | en_US |
| pubs.notes | No embargo | en_US |
| pubs.publisher-url | http://doi.acm.org/10.1145/2850419 | en_US |
| pubs.volume | 12 | en_US |
