An \(O(mn)\) algorithm for the anti-cent-dian problem

DOI10.1016/j.amc.2006.05.088zbMath1127.90387OpenAlexW1992319525MaRDI QIDQ864778

Marcos Colebrook, Joaquín Sicilia

Publication date: 13 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.088

zbMATH Keywords

anti-cent-dian problemundesirable location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Uses Software

• Find

Cites Work

• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Analytical models for locating undesirable facilities
• An \(O(mn)\) algorithm for the 1-maximin problem on a network
• A note on the location of an obnoxious facility on a network
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• From the median to the generalized center
• Obnoxious Facility Location on Graphs
• A polynomial time algorithm for finding the absolute center of a network
• A new algorithm for the undesirable 1-center problem on networks
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: An \(O(mn)\) algorithm for the anti-cent-dian problem