scientific article; zbMATH DE number 7236428
From MaRDI portal
Publication:5115792
DOI10.4230/LIPICS.SOCG.2018.24zbMATH Open1489.68185MaRDI QIDQ5115792FDOQ5115792
Timothy M. Chan, Dimitrios Skrepetos
Publication date: 18 August 2020
Title of this publication is not available (Why is that?)
Recommendations
- Approximate shortest paths and distance oracles in weighted unit-disk graphs
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Approximate shortest paths in weighted graphs
- Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time
- scientific article; zbMATH DE number 6469155
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Approximate Distance Queries in Disk Graphs
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 2119744
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Powers of tensors and fast matrix multiplication
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Title not available (Why is that?)
- Multiplying matrices faster than coppersmith-winograd
- Planar spanners and approximate shortest path queries among obstacles in the plane
- Compact oracles for reachability and approximate distances in planar digraphs
- Approximating geometric bottleneck shortest paths
- Shortest paths in intersection graphs of unit disks
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Compact and low delay routing labeling scheme for unit disk graphs
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- Improved sparse covers for graphs excluding a fixed minor
- Approximating the Diameter of Planar Graphs in Near Linear Time
- On bounded leg shortest paths problems
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
- Title not available (Why is that?)
- Many distances in planar graphs
- Constant Query Time $$(1+\epsilon )$$ -Approximate Distance Oracle for Planar Graphs
- Title not available (Why is that?)
- More Compact Oracles for Approximate Distances in Undirected Planar Graphs
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
- Faster Approximate Diameter and Distance Oracles in Planar Graphs
Cited In (10)
- Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
- Reverse shortest path problem for unit-disk graphs
- Shortest-Path Queries in Geometric Networks
- Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs
- Title not available (Why is that?)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
- Reverse shortest path problem in weighted unit-disk graphs
- Approximate Distance Queries in Disk Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115792)
