Efficient algorithms for the minmax regret path center problem with length constraint on trees

DOI10.1016/J.TCS.2022.03.017MaRDI QIDQ2136270zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang

Publication date 10 May 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.03.017

zbMATH Keywords

treescenterslocation theoryminmax regret optimizationpath centers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On the minmax regret path center problem on trees
• An improved algorithm for the minmax regret path center problem on trees
• An improved algorithm for the minmax regret path centdian problem on trees
• Minimax regret path location on trees
• On the minmax regret path median problem on trees

Cites work

• scientific article; zbMATH DE number 1670815 (Why is no real title available?)
• scientific article; zbMATH DE number 176745 (Why is no real title available?)
• scientific article; zbMATH DE number 1091558 (Why is no real title available?)
• A linear algorithm for a core of a tree
• A linear time algorithm for computing minmax regret 1-median on a tree network
• A note on the minmax regret centdian location on trees
• A review of extensive facility location in networks
• Algorithms for the robust 1-center problem on a tree
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An improved algorithm for the minmax regret median problem on a tree
• An improved algorithm for the minmax regret path centdian problem on trees
• An improved algorithm for the minmax regret path center problem on trees
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• Conditional location of path and tree shaped facilities on trees
• Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
• Extensive facility location problems on networks: an updated review
• Facility location problems with uncertainty on the plane
• Fast Algorithms for Finding Nearest Common Ancestors
• Finding cores of limited length
• Improved algorithms for the minmax-regret 1-center and 1-median problems
• Maintaining information in fully dynamic trees with top trees
• Minimax regret p-center location on a network with demand uncertainty
• Minimax regret path location on trees
• Minmax Regret Median Location on a Network Under Uncertainty
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
• Minmax regret location--allocation problem on a network under uncertainty
• Minmax regret solutions for minimax optimization problems with uncertainty
• On the minmax regret path median problem on trees
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Optimum Locations on a Graph with Probabilistic Demands
• Sensitivity Analysis in Minisum Facility Location Problems
• Sensitivity analysis of the optimal location of a facility
• Sorting weighted distances with applications to objective function evaluations in single facility location problems.
• The bi‐criteria doubly weighted center‐median path problem on a tree
• The centdian subtree on tree networks
• The generalized P‐forest problem on a tree network
• The optimal location of a path or tree in a tree network

Cited in

(2)

• A note on the minmax regret centdian location on trees
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks

This page was built for publication: Efficient algorithms for the minmax regret path center problem with length constraint on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136270)