5 citations · 5 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Reactive Proximity Data Structures for Graphs
David Eppstein, Michael T. Goodrich, Nil Mamano
We consider data structures for graphs where we maintain a subset of the nodes called sites, and allow proximity queries, such as asking for the closest site to a query node, and u…
cs.DS2017
Defining Equitable Geographic Districts in Road Networks via Stable Matching
David Eppstein, Michael Goodrich, Doruk Korkmaz +1
We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, wh…