A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256): Difference between revisions

@@ Property / cites work @@
+Algorithms for the minimum diameter terminal Steiner tree problem
+Normal rank
@@ Property / cites work @@
+An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs
+Normal rank
@@ Property / cites work @@
+Foundations of location analysis
@@ Property / cites work: Foundations of location analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
+Normal rank
@@ Property / cites work @@
+On the minimum diameter spanning tree problem
@@ Property / cites work: On the minimum diameter spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+A new approach to all-pairs shortest paths on real-weighted graphs
+Normal rank
@@ Property / cites work @@
+Network location of a reliable center using the most reliable route policy
+Normal rank
@@ Property / cites work @@
+State of the Art—Location on Networks: A Survey. Part I: The <i>p</i>-Center and <i>p</i>-Median Problems
+Normal rank
@@ Property / cites work @@
+Q4355484
@@ Property / cites work: Q4355484 / rank @@
+Normal rank