Additive One Approximation for Minimum Degree Spanning Tree: Breaking the O(mn) Time Barrier.

Sayan Bhattacharya, Ermiya Farokhnejad, Haoze Wang

Browse the full STOC paper archive.