21 citations · 40 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.OC2015★ 1 cited
Performance Bounds for the -Batch Greedy Strategy in Optimization Problems with Curvature
Yajing Liu, Zhenliang Zhang, Edwin K. P. Chong +1
The -batch greedy strategy is an approximate algorithm to solve optimization problems where the optimal solution is hard to obtain. Starting with the empty set, the -batch gr…
math.OC2015★ 4 cited
Bounding the Greedy Strategy in Finite-Horizon String Optimization
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki
We consider an optimization problem where the decision variable is a string of bounded length. For some time there has been an interest in bounding the performance of the greedy st…