Center problems with pos/neg weights on trees

DOI10.1016/S0377-2217(02)00211-4MaRDI QIDQ1869485zbMATH OpenOpenAlexFDO

Authors 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

center problemlocation problemobnoxious facilities

Mathematics Subject Classification ID

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

Recommendations

• Reverse 1-center problem on weighted trees
• The weighted \(k\)-center problem in trees for fixed \(k\)
• The weighted \(k\)-center problem in trees for fixed \(k\)
• Finding a core of a tree with pos/neg weight
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• A generalized algorithm for centrality problems on trees
• scientific article; zbMATH DE number 1744100
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
• The \(p\)-center problem in tree networks revisited
• Robust location problems with pos/neg weights on a tree

Cites work

• scientific article; zbMATH DE number 4209906 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• 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
• An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Convex Location Problems on Tree Networks
• Fibonacci heaps and their uses in improved network optimization algorithms
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Locating Centers on a Tree with Discontinuous Supply and Demand Regions
• Maintenance of configurations in the plane
• New Results on the Complexity of p-Centre Problems
• Obnoxious Facility Location on Graphs
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Technical Note—The Discrete Anti-P-Center Problem
• The obnoxious center problem on a tree

Cited in

(6)

• Improved algorithms for several network location problems with equality measures.
• Fighting terrorism: how to position rapid response teams?
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• The connected p-center problem on block graphs with forbidden vertices
• Efficient algorithms for center problems in cactus networks
• Locating a semi-obnoxious facility with expropriation

This page was built for publication: Center problems with pos/neg weights on trees

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