The 2-maxian problem on cactus graphs
From MaRDI portal
Publication:2339821
DOI10.1016/j.disopt.2014.04.001zbMath1308.90090MaRDI QIDQ2339821
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.04.001
Related Items
Polynomial invariants for cactuses, A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint, Brill-Noether conjecture on cactus graphs, A combinatorial algorithm for the ordered 1-median problem on cactus graphs, A modified optimal algorithm for 2-maxian location problems on cactus graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Median problems with positive and negative weights on cycles and cacti
- The \(p\)-Maxian problem on interval graphs
- The \(p\)-maxian problem on block graphs
- 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