← Search

Grace J Li

1 accepted papers

2026

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion

ICLR 2026poster

We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned input is a forest that must be given additional edges to form…

Cited by 0SourcecodeScholar