Block-vertex duality and the one-median problem
From MaRDI portal
Publication:3792460
DOI10.1002/net.3230150402zbMath0647.90031OpenAlexW2078606275MaRDI QIDQ3792460
No author found.
Publication date: 1985
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230150402
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Inventory, storage, reservoirs (90B05)
Related Items (10)
Improved algorithms for some competitive location centroid problems on paths, trees and graphs ⋮ Minisum location of a travelling salesman on simple networks ⋮ The Connected p-Centdian Problem on Block Graphs ⋮ A linear algorithm for the pos/neg-weighted 1-median problem on a cactus ⋮ A note on locating a central vertex of a 3-cactus graph ⋮ Median problems on wheels and cactus graphs ⋮ Algorithms for connected \(p\)-centdian problem on block graphs ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ Exploiting Structure: Location Problems on Trees and Treelike Graphs ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs
Cites Work
This page was built for publication: Block-vertex duality and the one-median problem
