Dynamic and static algorithms for optimal placement of resources in a tree (Q671529): 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/0304-3975(96)00089-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2007921877
@@ Property / OpenAlex ID: W2007921877 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230327
@@ Property / cites work: Q4230327 / rank @@
+Normal rank
@@ Property / cites work @@
+Separator based sparsification for dynamic planar graph algorithms
+Normal rank
@@ Property / cites work @@
+Q4037428
@@ Property / cites work: Q4037428 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Q4036576
@@ Property / cites work: Q4036576 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic planarity testing with applications
@@ Property / cites work: Fully dynamic planarity testing with applications / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+Worst-Case and Probabilistic Analysis of a Geometric Location Problem
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Maintaining Partial Sums
@@ Property / cites work: On the Complexity of Maintaining Partial Sums / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:671529