"An O ( n 2log n ) Time Algorithm for ..."

Anil Maheshwari et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-77120-3_58

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/MaheshwariNSY07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/MaheshwariNSY07
Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
An O ( n ²log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.