AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion

Nate Veldt, Thomas Stanley, Benjamin W Priest, Trevor Steil, Keita Iwabuchi, T.S. Jayram, Grace J Li, Geoffrey Sanders

ICLR 2026 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add a few extra representatives per component (MultiRepMFC with budget b > 0 vs MFC-Approx b=0) (ablation)MultiRepMFC · Cooking, GreenGenes, FashionMNIST, Names-UScost ratio vs MFC-OPTImproved
allocate representatives with dynamic programming instead of greedy or fixed per-component (ablation)MultiRepMFC · Cooking, GreenGenes, FashionMNIST, Names-UScost ratio at fixed runtimeImproved
use Greedy allocation instead of Fixed(l) allocation (ablation)MultiRepMFC · four datasetscost ratio at fixed runtimeHurt
use DP allocation to minimize instance-specific bound alpha (ablation)MultiRepMFC · four datasetsalpha boundImproved
use multiple representatives with large budget on imbalanced forestsMultiRepMFC · Names-USruntime vs MFC-OPTNo clear effect
tighter analysis of one-arbitrary-representative algorithmMFC-Approx · worst-case approximation for MFCapproximation factor: 2.62 -> 2Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy