Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds

DOI10.1137/1.9781611975994.95MaRDI QIDQ5146873zbMATH OpenOpenAlexFDO

Authors Yair Barta, Nova Fandina, Seeun William Umboh

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.95

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Low-Rank Online Metric Learning
• Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
• scientific article; zbMATH DE number 7759300 (Why is no real title available?)
• Online embedding of metrics
• Tight bounds for online weighted tree augmentation

This page was built for publication: Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146873)