"Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored ..."

Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-77404-6_7

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/latin/BanerjeeBC18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/BanerjeeBC18
Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis:
Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets. LATIN 2018: 80-93

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.