An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree (Q924878): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2007.02.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2005183677
@@ Property / OpenAlex ID: W2005183677 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Minmax Regret Median Location on a Network Under Uncertainty
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the minmax regret median problem on a tree
+Normal rank
@@ Property / cites work @@
+Minmax-regret robust 1-median location on a tree
@@ Property / cites work: Minmax-regret robust 1-median location on a tree / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for the Minmax Regret 1-Median Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:924878