scientific article; zbMATH DE number 6866342

DOI10.4230/LIPIcs.ITCS.2017.52zbMath1402.68033arXiv1612.05623MaRDI QIDQ4638107

Michael Dinitz, Ze Yu Zhang

Publication date: 3 May 2018

Full work available at URL: https://arxiv.org/abs/1612.05623

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsdistance oracles

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for spanner problems and directed Steiner forest
• Approximate Distance Oracles with Improved Bounds
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• A threshold of ln n for approximating set cover
• Approximate distance oracles
• Metric Embeddings with Relaxed Guarantees
• Heuristics for the fixed cost median problem
• A Parallel Repetition Theorem
• Approximating Low-Stretch Spanners
• Analytical approach to parallel repetition
• Approximate distance oracles with constant query time
• Directed spanners via flow-based linear programs
• Spanners with Slack
• Approximate Distance Oracles with Improved Query Time

This page was built for publication: