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

Haitao Wang, Jingru Zhang (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2025-03-04

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/WangZ17g
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/WangZ17g
Haitao Wang, Jingru Zhang:
An O(n\log n)-Time Algorithm for the k-Center Problem in Trees. CoRR abs/1705.02752 (2017)

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.