Ya-Feng Liu

most citedA New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem

5 citations · 6 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2017★ 5 cited

A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem

Rui Diao, Ya-Feng Liu, Yu-Hong Dai

The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals ${[a_{i, 1}, a_{i, 2}]}_{i = 1}^{n}$ and a target in…

math.OC2015★ 1 cited

An Efficient Inexact Newton-CG Algorithm for the Smallest Enclosing Ball Problem of Large Dimensions

Ya-Feng Liu, Rui Diao, Feng Ye +1

In this paper, we consider the problem of computing the smallest enclosing ball (SEB) of a set of $m$ balls in $R^{n},$ where the product $mn$ is large. We first approximate…