"A Sub-quadratic Time Algorithm for the Proximity Connected k-center ..."

Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari (2022)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2022-11-23

- no documents available
- export record
  dblp key:
  - conf/cccg/BhattacharyaKM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/BhattacharyaKM22
Binay Bhattacharya, Tsunehiko Kameda, Amirhossein Mozafari:
A Sub-quadratic Time Algorithm for the Proximity Connected k-center Problem on Paths via Modular Arithmetic. CCCG 2022: 40-47

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.