"An O(n log n)-Time Algorithm for the k-Center Problem in Trees."

Haitao Wang, Jingru Zhang (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2018.72

access: open

type: Conference or Workshop Paper

metadata version: 2021-06-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/0001Z18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/0001Z18
Haitao Wang, Jingru Zhang:
An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SoCG 2018: 72:1-72:15

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.