A note on maximizing a submodular set function subject to a knapsack constraint
Year of publication: |
2004
|
---|---|
Authors: | Sviridenko, Maxim |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 32.2004, 1, p. 41-43
|
Saved in:
Saved in favorites
Similar items by person
-
A linear time approximation scheme for makespan minimization in an open shop with release dates
Kononov, Alexander, (2002)
-
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Gamarnik, David, (2005)
-
Minimizing Makespan in No-Wait Job Shops
Bansal, Nikhil, (2005)
- More ...