Center problems with pos/neg weights on trees

DOI10.1016/S0377-2217(02)00211-4zbMath1011.90028OpenAlexW2086592766MaRDI QIDQ1869485

Helidon Dollani, Rainer E. Burkard

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00211-4

zbMATH Keywords

location problemcenter problemobnoxious facilities

Mathematics Subject Classification ID

Trees (05C05) Discrete location and assignment (90B80)

Related Items

Efficient algorithms for center problems in cactus networks, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Locating a semi-obnoxious facility with expropriation, The connected \(p\)-center problem on block graphs with forbidden vertices, Improved algorithms for several network location problems with equality measures.

Cites Work

• Unnamed Item
• Unnamed Item
• Maintenance of configurations in the plane
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• The Obnoxious Center Problem on a Tree
• New Results on the Complexity of p-Centre Problems
• 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 $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• Locating Centers on a Tree with Discontinuous Supply and Demand Regions
• Obnoxious Facility Location on Graphs
• Convex Location Problems on Tree Networks
• Technical Note—The Discrete Anti-P-Center Problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph