A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2942194578
@@ Property / OpenAlex ID: W2942194578 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.12061
@@ Property / arXiv ID: 1904.12061 / rank @@
+Normal rank
@@ Property / cites work @@
+Decreasing the diameter of bounded degree graphs
@@ Property / cites work: Decreasing the diameter of bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5136224
@@ Property / cites work: Q5136224 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091032
@@ Property / cites work: Q5091032 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximability and non-approximability results for graph diameter decreasing problems
+Normal rank
@@ Property / cites work @@
+Q5369529
@@ Property / cites work: Q5369529 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the continuous diameter when augmenting a tree with a shortcut
+Normal rank
@@ Property / cites work @@
+Augmenting graphs to minimize the diameter
@@ Property / cites work: Augmenting graphs to minimize the diameter / rank @@
+Normal rank
@@ Property / cites work @@
+The parametric complexity of graph diameter augmentation
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Diameter-Optimally Augmenting Paths
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs to Meet Diameter Requirements
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+New Results on the Complexity of <i>p</i>-Centre Problems
+Normal rank
@@ Property / cites work @@
+A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree
+Normal rank
@@ Property / cites work @@
+Diameter increase caused by edge deletion
@@ Property / cites work: Diameter increase caused by edge deletion / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for diameter-optimally augmenting paths in a metric space
+Normal rank
@@ Property / cites work @@
+An O(n log n)-Time Algorithm for the k-Center Problem in Trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5918103