Approximations for monotone and nonmonotone submodular maximization with Knapsack constraints

Ariel Kulik; Hadas Shachnai; Tami Tamir

Year of publication:	2013
Authors:	Kulik, Ariel ; Shachnai, Hadas ; Tamir, Tami
Published in:	Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 38.2013, 4, p. 729-739
Subject:	submodular maximization \| knapsack constraints \| maximum coverage \| generalized assignment problem \| randomization \| approximation algorithms \| Theorie \| Theory \| Mathematische Optimierung \| Mathematical programming \| Algorithmus \| Algorithm \| Ganzzahlige Optimierung \| Integer programming

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10010210721

A service of the