Articles by Sebastian Förster
Computer Science > Data Structures and Algorithms
Graph emulators and hopsets are two fundamental concepts for distance approximation. When the multiplicative stretch is $1+ε$ for arbitrarily small $ε>0$, these structures are known as near-additive emulators and near-exact hopsets, respectively. Prior work showed that there is a remarkable similarity between the constructions and guarantees of these two objects.
[2307.15557] Dynamic algorithms for k-center on graphs
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2307.09961] On Dynamic Graph Algorithms with Predictions
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[2307.09258] Fast 2-Approximate All-Pairs Shortest Paths
arXiv:2307.09258 (cs) Download a PDF of the paper titled Fast 2-Approximate All-Pairs Shortest Paths, by Michal Dory and 5 other authors Download PDF Submission history From: Tijn de Vos [ view email] [v1] Tue, 18 Jul 2023 13:42:55 UTC (743 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Links to Code Toggle CatalyzeX Code Finder for...
[2211.01152] New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
[Submitted on 2 Nov 2022 ( v1 ), last revised 18 Jul 2023 (this version, v3)] Title:New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths Download a PDF of the paper titled New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths, by Michal Dory and 3 other authors Download PDF Abstract: We provide new tradeoffs between approximation and running time for the decremental all-pairs shortest paths (APSP) problem.
How To Leverage Digital Transformation for Customer Experience
The job of delivering a unique and exciting customer journey has never been easier with the tools we have access to now — namely social media, general web analytics, and CRM systems. Yet, there are still areas where all these data points and insights are treated as singular, one-dimensional, or irrelevant data.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Sebastian
Contact Sebastian, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack