The discrepancy of shortest paths
From MaRDI portal
Cites work
- A local-to-global theorem for congested shortest paths
- A trace bound for the hereditary discrepancy
- Constructive discrepancy minimization with hereditary L2 guarantees
- Covering planar metrics (and beyond): O(1) trees suffice
- Differentially private all-pairs shortest path distances: improved algorithms and lower bounds
- Differentially private range query on shortest paths
- Differentially Private Release of Synthetic Graphs
- Faster shortest-path algorithms for planar graphs
- Folklore sampling is optimal for exact hopsets: confirming the \(\sqrt{n}\) barrier
- Geodesic geometry on graphs
- Geometric discrepancy. An illustrated guide
- Highway dimension, shortest paths, and provably efficient algorithms
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Irreducible nonmetrizable path systems in graphs
- Near-optimal distance emulator for planar graphs
- New diameter-reducing shortcuts and directed hopsets: breaking the \(O(\sqrt{n})\) barrier
- On sparse hitting sets: from fair vertex cover to highway dimension
- On the structure of unique shortest paths in graphs
- Optimal bounds on private graph approximation
- Optimal private halfspace counting via discrepancy
- Quasi-random graphs
- Sparse Sourcewise and Pairwise Distance Preservers
- The algorithmic foundations of differential privacy
- The discrepancy of shortest paths
- Theory of Cryptography
Cited in
(2)
This page was built for publication: The discrepancy of shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875181)
