Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
!!Link opens in a new tab
!!Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Approximate shortest paths and distance oracles in weighted unit-disk graphs
Timothy M. Chan
, Dimitrios Skrepetos
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximate shortest paths and distance oracles in weighted unit-disk graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
All-pairs
33%
Approximate Distance Oracles
33%
Approximate Shortest Paths
100%
Bichromatic Closest Pair
33%
Distance Oracles
100%
Further Application
33%
Graph Metrics
33%
Log-log
33%
Near-linear Time Algorithm
33%
Planar Points
33%
Query Response Time
66%
Shortest Distance
100%
Shortest Path Problem
33%
Time Algorithm
33%
Unit Disk Graph
100%
Mathematics
Approximates
100%
Bichromatic Closest Pair
33%
Data Structure
33%
Linear Time
33%
Metric Graphs
33%
Path Problem
33%
Planar Point
33%
Unit Disk
100%
Computer Science
Approximation (Algorithm)
33%
Data Structure
33%
Preprocessing Time
100%
Shortest Path Problem
33%