Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ - Location search optimization - Document - PDFSEARCH.IO

First Page	Meta Content
	Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§ Add to Reading List Document Date: 2010-04-22 09:35:25 Open Document File Size: 368,91 KB Share Result on Facebook City HKUST / Beijing / / Country Korea / China / France / / / Facility Soongsil University / / IndustryTerm approximation algorithm / query algorithm / geographic information systems / / Organization Soongsil University / Seoul / School of Computing / Soongsil University Research Fund / Department of Computer Science and Engineering / Research Grant Council / / Position Prime Minister / / ProgrammingLanguage L / / Technology previous algorithm / approximation algorithm / query algorithm / BUSHWHACK algorithm / / SocialTag Search algorithms Computational geometry Combinatorial optimization Routing algorithms Network theory Shortest path problem Voronoi diagram Point location Time complexity Theoretical computer science

Querying Approximate Shortest Paths in Anisotropic Regions∗ Siu-Wing Cheng† Hyeon-Suk Na‡ Antoine Vigneron§Add to Reading List