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