The \(p\)-maxian problem on block graphs
From MaRDI portal
Publication:711397
DOI10.1007/s10878-008-9198-1zbMath1200.90117MaRDI QIDQ711397
Publication date: 26 October 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9198-1
90B80: Discrete location and assignment
Related Items
The backup 2-median problem on block graphs, The \(p\)-Maxian problem on interval graphs, The 2-maxian problem on cactus graphs
Cites Work
- Unnamed Item
- The inverse 1-maxian problem with edge length modification
- A polynomial method for the pos/neg weighted 3-median problem on a tree
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- 2-medians in trees with pos/neg weights
- The \(p\)-maxian problem on a tree
- Obnoxious Facility Location on Graphs