The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
From MaRDI portal
Publication:985733
DOI10.1007/S00607-010-0084-1zbMATH Open1208.90108OpenAlexW1977215779MaRDI QIDQ985733FDOQ985733
Authors: Xiaoqin Zhang, Liying Kang, Yu-kun Cheng 
Publication date: 6 August 2010
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0084-1
Recommendations
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
- The connected \(p\)-median problem on block graphs
- scientific article; zbMATH DE number 5926326
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
Cites Work
- Title not available (Why is that?)
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- 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
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- 2-medians in trees with pos/neg weights
- Efficient computation of 2-medians in a tree network with positive/negative weights
- Center location problems on tree graphs with subtree-shaped customers
- Optimal vertex ranking of block graphs
- Optimal path cover problem on block graphs
Cited In (4)
This page was built for publication: The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985733)
