The p-maxian problem on block graphs

DOI10.1007/S10878-008-9198-1zbMATH Open1200.90117OpenAlexW1974538268MaRDI QIDQ711397FDOQ711397

Authors: Liying Kang, Yu-kun Cheng 

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

Recommendations

• The connected \(p\)-centdian problem on block graphs
• Algorithms for connected \(p\)-centdian problem on block graphs
• The \(p\)-Maxian problem on interval graphs
• The connected \(p\)-median problem on block graphs
• The 1-Center Problem: Exploiting Block Structure

zbMATH Keywords

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

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• 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
• Title not available (Why is that?)
• The \(p\)-maxian problem on a tree
• Obnoxious Facility Location on Graphs
• 2-medians in trees with pos/neg weights

Cited In (9)

• The \(p\)-maxian problem on a tree
• The backup 2-median problem on block graphs
• The \(p\)-Maxian problem on interval graphs
• The 2-maxian problem on cactus graphs
• Title not available (Why is that?)
• A modified optimal algorithm for 2-maxian location problems on cactus graphs
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
• The 1-Center Problem: Exploiting Block Structure
• 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)