Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Conference or Workshop Paper |
| Scope | Discipline-based scholarship |
| Published in Proceedings | Yes |
| Title | Defining isochrones in multimodal spatial networks |
| Organization Unit | |
| Authors |
|
| Presentation Type | paper |
| Item Subtype | Original Work |
| Refereed | Yes |
| Status | Published in final form |
| Language |
|
| ISBN | 978-1-4503-0717-8 |
| Page Range | 2381 - 2384 |
| Event Title | 20th ACM Conference on Information and Knowledge Management |
| Event Type | conference |
| Event Location | Glasgow, UK |
| Event Start Date | October 24 - 2011 |
| Event End Date | October 28 - 2011 |
| Series Name | Proceedings of the 20th ACM international conference on Information and knowledge management |
| Place of Publication | New York, USA |
| Publisher | Association for Computing Machinery |
| Abstract Text | An isochrone in a spatial network is the minimal, possibly disconnected subgraph that covers all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we formally define isochrones for multimodal spatial networks with different transportation modes that can be discrete or continuous in, respectively, space and time. For the computation of isochrones we propose the multimodal incremental network expansion (MINE) algorithm, which is independent of the actual network size and depends only on the size of the isochrone. An empirical study using real-world data confirms the analytical results. |
| Related URLs | |
| Digital Object Identifier | 10.1145/2063576.2063972 |
| Other Identification Number | merlin-id:6170 |
| PDF File |
Download from ZORA
|
| Export |
BibTeX
EP3 XML (ZORA)
|