# Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays

> Research article (Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017) · cited 27× · AI/ML

**Wikidata**: [openalex:W4237102200](https://www.wikidata.org/wiki/openalex:W4237102200)  
**Source**: https://4ort.xyz/entity/polylogarithmic-bounds-on-the-competitiveness-of-min-cost-perfect-matching-with-delays