Y
Yuli Ye
Researcher at University of Toronto
Publications - 6
Citations - 208
Yuli Ye is an academic researcher from University of Toronto. The author has contributed to research in topics: Approximation algorithm & Greedy algorithm. The author has an hindex of 5, co-authored 6 publications receiving 179 citations.
Papers
More filters
Proceedings ArticleDOI
Max-Sum diversification, monotone submodular functions and dynamic updates
TL;DR: This paper considers the setting where the authors are given a set of elements in a metric space and a set valuation function f defined on every subset and shows that a natural single swap local search algorithm provides a 2-approximation in this more general setting.
Journal ArticleDOI
Elimination graphs
Yuli Ye,Allan Borodin +1 more
TL;DR: It turns out that if the authors take P as a graph with maximum independent set size no greater than , then this definition gives a natural generalization of both chordal graphs and (
Book ChapterDOI
Elimination Graphs
Yuli Ye,Allan Borodin +1 more
TL;DR: An extension of chordal graphs whereby the neighbors of v that occur later than v in the elimination order have at most k independent vertices is defined, and several natural classes of graphs are sequentially k -independent for small k .
Journal ArticleDOI
Priority algorithms for the subset-sum problem
Yuli Ye,Allan Borodin +1 more
TL;DR: This paper studies priority algorithm approximation ratios for the Subset-Sum Problem, focusing on the power of revocable decisions, for which the accepted data items can be later rejected to maintain the feasibility of the solution.
Book ChapterDOI
Priority algorithms for the subset-sum problem
Yuli Ye,Allan Borodin +1 more
TL;DR: This paper study's priority algorithm approximation ratios for the Subset-Sum Problem, focusing on the power of revocable decisions, provides a tight bound of α ≈ 0.657 for irrevocable priority algorithms.