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

DOI10.1016/J.TCS.2022.03.017OpenAlexW4221098277MaRDI QIDQ2136270FDOQ2136270

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)

Cites Work

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

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)