Finding a core of a tree with pos/neg weight
From MaRDI portal
Publication:1935945
Recommendations
Cites work
- scientific article; zbMATH DE number 3328106 (Why is no real title available?)
- 2-medians in trees with pos/neg weights
- A branch-and-cut algorithm for the median-path problem
- A linear algorithm for a core of a tree
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- A polynomial method for the pos/neg weighted 3-median problem on a tree
- Algorithms for path medi-centers of a tree
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- Computing the 2‐median on tree networks in O(n lg n) time
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Finding the \(\ell\)-core of a tree
- Obnoxious Facility Location on Graphs
Cited in
(11)- Finding an optimal core on a tree network with M/G/c/c state-dependent queues
- An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree
- Finding cores of limited length
- Finding the \(\ell\)-core of a tree
- Center problems with pos/neg weights on trees
- Two paths location of a tree with positive or negative weights
- Finding the two-core of a tree
- The extensive 1-median problem with radius on networks
- An algorithm for solving the bi-objective median path-shaped facility on a tree network
- Two paths location of a tree with positive or negative weights
- Fixed gate point location problems
This page was built for publication: Finding a core of a tree with pos/neg weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935945)
