A modified optimal algorithm for 2-Maxian location problems on cactus graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 3328106 (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 computing longest paths in cactus graphs
- An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs
- Discrete location problems with push-pull objectives
- Median problems with positive and negative weights on cycles and cacti
- Obnoxious Facility Location on Graphs
- The 2-maxian problem on cactus graphs
- The \(p\)-Maxian problem on interval graphs
- The p-maxian problem on a tree
- The \(p\)-maxian problem on block graphs
This page was built for publication: A modified optimal algorithm for 2-Maxian location problems on cactus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979777)