A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint

DOI10.1007/s10878-020-00650-9zbMath1462.90067OpenAlexW3084816380MaRDI QIDQ830937

Nguyen Thanh Hung, Huong Nguyen-Thu, Trung-Kien Nguyen

Publication date: 10 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00650-9

zbMATH Keywords

treelocation problemconvexmaxian problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

The balanced 2-median and 2-maxian problems on a tree

Cites Work

• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• The connected \(p\)-median problem on block graphs
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• The connected \(p\)-center problem on block graphs with forbidden vertices
• A linear time algorithm for computing minmax regret 1-median on a tree network
• The \(p\)-Maxian problem on interval graphs
• Discrete location problems with push-pull objectives
• The \(p\)-maxian problem on block graphs
• Algorithms for connected \(p\)-centdian problem on block graphs
• A review of extensive facility location in networks
• The connected \(p\)-center problem on cactus graphs
• Extensive facility location problems on networks: an updated review
• Algorithmic results for ordered median problems
• The 2-maxian problem on cactus graphs
• Inverse median problems
• The \(p\)-maxian problem on a tree
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Obnoxious Facility Location on Graphs
• Minmax Regret Median Location on a Network Under Uncertainty
• Computing the 2‐median on tree networks in O(n lg n) time

This page was built for publication: A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint