String Submodular Functions With Curvature Constraints
From MaRDI portal
Publication:2980629
DOI10.1109/TAC.2015.2440566zbMath1359.90126arXiv1303.3018MaRDI QIDQ2980629
Edwin K. P. Chong, Ali Pezeshki, Zhen-Liang Zhang, William Moran
Publication date: 3 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.3018
90C27: Combinatorial optimization
Related Items
Performance bounds with curvature for batched greedy optimization, Exploiting submodularity to quantify near-optimality in multi-agent coverage problems, Submodular optimization problems and greedy strategies: a survey, A unifying look at sequence submodularity, Improved bounds for the greedy strategy in optimization problems with curvature, Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences