Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462): Difference between revisions

@@ Property / cites work @@
+Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
+Normal rank
@@ Property / cites work @@
+Minimax Regret 1-Sink Location Problems in Dynamic Path Networks
+Normal rank
@@ Property / cites work @@
+Minimax regret 1-sink location problem in dynamic path networks
+Normal rank
@@ Property / cites work @@
+Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
+Normal rank
@@ Property / cites work @@
+Multiple Sink Location Problems in Dynamic Path Networks
+Normal rank
@@ Property / cites work @@
+An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
+Normal rank
@@ Property / cites work @@
+Minimax Regret k-sink Location Problem in Dynamic Path Networks
+Normal rank
@@ Property / cites work @@
+Minmax regret 1-facility location on uncertain path networks
+Normal rank
@@ Property / cites work @@
+Faster all-pairs shortest paths via circuit complexity
+Normal rank
@@ Property / cites work @@
+Minimax regret 1-sink location problem in dynamic cycle networks
+Normal rank