On alternativep-center problems

DOI10.1007/BF01415760zbMath0773.90043OpenAlexW2320600262MaRDI QIDQ4015966

No author found.

Publication date: 12 November 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415760

zbMATH Keywords

NP-hardundirected connected graphpositive edge lengthsvertex \(p\)-center problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (4)

Covering moving points with anchored disks ⋮ Selecting and covering colored points ⋮ Generalized \(p\)-center problems: Complexity results and approximation algorithms ⋮ Disjunctive optimization, \(\max\)-separable problems and extremal algebras

Cites Work

• Unnamed Item
• The absolute centre of a graph
• On the Complexity of Some Common Geometric Location Problems
• New Results on the Complexity of p-Centre Problems
• A finite algorithm for the continuousp-center location problem on a graph
• On the Solution Value of the Continuous p-Center Location Problem on a Graph
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• On the computational complexity of centers locating in a graph
• The Centers and Medians of a Graph
• The Optimum Location of Multi-centres on a Graph

This page was built for publication: On alternativep-center problems