Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n(logn)2/loglogn) algorithm for the single maximum ..."

Joachim Spoerhase, Hans-Christoph Wirth (2009)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2008.12.009

access: closed

type: Journal Article

metadata version: 2018-11-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/SpoerhaseW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/SpoerhaseW09
Joachim Spoerhase, Hans-Christoph Wirth:
An O(n(logn)²/loglogn) algorithm for the single maximum coverage location or the (1, X_p)-medianoid problem on trees. Inf. Process. Lett. 109(8): 391-394 (2009)

a service of

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.