On alternativep-center problems

DOI10.1007/BF01415760MaRDI QIDQ4015966zbMATH OpenOpenAlexFDO

Authors

Publication date 12 November 1992

Published in 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-hardpositive edge lengthsundirected connected graphvertex \(p\)-center problem

Mathematics Subject Classification ID

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

Recommendations

• On the Complexity of Some Common Geometric Location Problems
• Generalized p-center problems: Complexity results and approximation algorithms
• scientific article; zbMATH DE number 5205606
• scientific article; zbMATH DE number 849074
• Un nuevo resultado sobre la complejidad del problema delP-centro

Cites work

• A finite algorithm for the continuousp-center location problem on a graph
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• New Results on the Complexity of p-Centre Problems
• On the Complexity of Some Common Geometric Location Problems
• On the computational complexity of centers locating in a graph
• On the Solution Value of the Continuous p-Center Location Problem on a Graph
• The absolute centre of a graph
• The Centers and Medians of a Graph
• The Optimum Location of Multi-centres on a Graph

Cited in

(15)

• Generalized p-center problems: Complexity results and approximation algorithms
• Selecting and covering colored points
• Disjunctive optimization, \(\max\)-separable problems and extremal algebras
• Complexity of determining the most vital elements for the p-median and p-center location problems
• Complexity of the multi-service center problem
• An algebraic model for the center problem
• An efficient \(g\)-centroid location algorithm for cographs
• Un nuevo resultado sobre la complejidad del problema delP-centro
• On the Complexity of Some Common Geometric Location Problems
• scientific article; zbMATH DE number 4209906 (Why is no real title available?)
• scientific article; zbMATH DE number 125459 (Why is no real title available?)
• Covering moving points with anchored disks
• Complexity of the multi-service center problem
• A note on the p-center problem
• Approximability results for the $p$-centdian and the converse centdian problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015966)