Article1984

A Linear-Time Algorithm for Maxisum Facility Location on Tree Networks

Unknown author

47 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 treats a topic in “obnoxious facility location,” namely the problem of locating a single facility in an n-vertex tree network so as to maximize the sum of its weighted distances from the vertices. It is shown that use of a suitable data structure permits a solution algorithm with computational effort O(n), an improvement over the O(n 2 ) required by a previously indicated procedure.

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 — 47 citations exist upstream.

References

1971Optimal Center Location in Simple Networks 1978Locating an Obnoxious Facility on a Network 1976Convex Location Problems on Tree Networks

Cited by

2011Strategy-proof approximation mechanisms for an obnoxious facility game on networks 1987Single Facility Location on Networks 2005Undesirable facility location problems on multicriteria networks 2011The Location of Undesirable Facilities

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.