The p-maxian problem on block graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3328106 (Why is no real title available?)
- 2-medians in trees with pos/neg weights
- 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
- Obnoxious Facility Location on Graphs
- The \(p\)-maxian problem on a tree
- The inverse 1-maxian problem with edge length modification
Cited in
(11)- The \(p\)-maxian problem on a tree
- The connected \(p\)-centdian problem on block graphs
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- The backup 2-median problem on block graphs
- scientific article; zbMATH DE number 5060433 (Why is no real title available?)
- Algorithms for connected \(p\)-centdian problem on block graphs
- A modified optimal algorithm for 2-Maxian location problems on cactus graphs
- The 1-Center Problem: Exploiting Block Structure
- The \(p\)-Maxian problem on interval graphs
- The 2-maxian problem on cactus graphs
- The connected \(p\)-median problem on complete multi-layered graphs
This page was built for publication: The \(p\)-maxian problem on block graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711397)