The \(p\)-maxian problem on block graphs

DOI10.1007/S10878-008-9198-1zbMath1200.90117OpenAlexW1974538268MaRDI QIDQ711397

Yu-kun Cheng, Li-ying Kang

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

zbMATH Keywords

location theoryblock graphobnoxious facility\(p\)-maxian problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (6)

A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ The \(p\)-Maxian problem on interval graphs ⋮ The backup 2-median problem on block graphs ⋮ A modified optimal algorithm for 2-maxian location problems on cactus graphs ⋮ The 2-maxian problem on cactus graphs ⋮ The connected p-median problem on complete multi-layered 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

This page was built for publication: The \(p\)-maxian problem on block graphs