Article1973

Minimax Location of a Facility in an Undirected Tree Graph

190 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Complexity and Algorithms in Graphs Computational Geometry and Mesh Generation

Abstract

This paper is addressed to the problem of locating the absolute and vertex centers (minimax criterion) of an undirected tree graph. Based upon a convexity property of the criterion function a very simple and efficient algorithm is offered that locates the minimax point by locating first a maximax point. The minimax is at the mid-point of the maximum path from the maximax point. The vertex center is located simultaneously.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 190 citations exist upstream.

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Cited by

1983Locational analysis 1983State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure 1976THE LOCATION OF A CENTER‐MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE*1976Convex Location Problems on Tree Networks 1981Location on Tree Networks: P-Centre and n-Dispersion Problems 1974A Minimax Location Problem on a Network 1977The m-Center Problem: Minimax Facility Location 1985The optimal location of a path or tree in a tree network

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.