Improved algorithms for computing minmax regret sinks on dynamic path and tree networks

DOI10.1016/J.TCS.2015.07.009zbMATH Open1333.90069OpenAlexW1093958314MaRDI QIDQ896121FDOQ896121

Tsunehiko Kameda, Binay Bhattacharya

Publication date: 11 December 2015

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

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

Recommendations

• Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
• scientific article; zbMATH DE number 7561368
• Minimax regret sink location problem in dynamic tree networks with uniform capacity
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• An improved algorithm for the minmax regret path centdian problem on trees
• Minimax regret 1-sink location problems in dynamic path networks
• An improved algorithm for the minmax regret path center problem on trees
• Minimax regret k-sink location problem in dynamic path networks
• Minimax regret 1-sink location problem in dynamic path networks
• Minimax regret vertex 2-sink location problem in dynamic path networks

zbMATH Keywords

facility locationuncertain demandrobust solutionminmax regret optimizationsink location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Cites Work

• Robust discrete optimization and its applications
• Algorithms for the robust 1-center problem on a tree
• Minmax regret 1-facility location on uncertain path networks
• Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
• Minimax Regret k-sink Location Problem in Dynamic Path Networks
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
• Title not available (Why is that?)
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Minimax regret 1-sink location problem in dynamic cycle networks
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• A linear time algorithm for computing minmax regret 1-median on a tree network
• Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
• Mathematical Foundations of Computer Science 2003

Cited In (15)

• Multiple sink location problem in path networks with a combinational objective
• A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS
• Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
• Minmax regret for sink location on dynamic flow paths with general capacities
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
• Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
• Minsum \(k\)-sink problem on path networks
• Capacity provisioning for evacuation on path networks
• Title not available (Why is that?)
• Minimax regret 1-sink location problem with accessibility in dynamic general networks
• A linear time algorithm for computing minmax regret 1-median on a tree network
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

This page was built for publication: Improved algorithms for computing minmax regret sinks on dynamic path and tree networks

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