Open AccessSubmodular Maximization with Uncertain Knapsack Capacity
Author(s) -
Yasushi Kawase,
Hanna Sumita,
Takuro Fukunaga
Publication year - 2019
Publication title -
siam journal on discrete mathematics
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.843
H-Index - 66
eISSN - 1095-7146
pISSN - 0895-4801
DOI - 10.1137/18m1174428
Subject(s) - knapsack problem , submodular set function , mathematics , robustness (evolution) , maximization , monotone polygon , mathematical optimization , randomized algorithm , combinatorics , upper and lower bounds , polynomial time approximation scheme , discrete mathematics , mathematical analysis , biochemistry , chemistry , geometry , gene
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom