2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2023★ 2 cited
A Simple 2-Approximation for Maximum-Leaf Spanning Tree
I-Cheng Liao, Hsueh-I Lu
For an -edge connected simple graph , finding a spanning tree of with the maximum number of leaves is MAXSNP-complete. The problem remains NP-complete even if is plan…
cs.LG2022★ 1 cited
Learning to Optimize Quasi-Newton Methods
Isaac Liao, Rumen R. Dangovski, Jakob N. Foerster +1
Fast gradient-based optimization algorithms have become increasingly essential for the computationally efficient training of machine learning models. One technique is to multiply t…