A combinatorial algorithm for the ordered 1-median problem on cactus graphs

DOI10.1007/s12597-019-00402-2zbMath1486.90118OpenAlexW2966843000MaRDI QIDQ2329555

van Huy Pham, Nguyen Chi Tam

Publication date: 18 October 2019

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-019-00402-2

zbMATH Keywords

location problemconvexcactusordered 1-median

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• Algorithmic results for ordered median problems
• The 2-maxian problem on cactus graphs
• Efficient algorithms for center problems in cactus networks
• The \(p\)-maxian problem on a tree
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Centdian Computation in Cactus Graphs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Slowing down sorting networks to obtain faster sorting algorithms
• Computing the 2‐median on tree networks in O(n lg n) time

This page was built for publication: A combinatorial algorithm for the ordered 1-median problem on cactus graphs