On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem

Identifier:nobleid.org/w1/20260515/D7DFB778

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/D7DFB778.svg?ark=w1%2F20260515%2FD7DFB778)](https://nobleid.org/work/w1/20260515/D7DFB778)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy