Some results on approximate 1-median selection in metric spaces (Q418725): 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.tcs.2011.12.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2005964087
@@ Property / OpenAlex ID: W2005964087 / rank @@
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Approximating Betweenness Centrality
@@ Property / cites work: Approximating Betweenness Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate clustering via core-sets
@@ Property / cites work: Approximate clustering via core-sets / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
+Normal rank
@@ Property / cites work @@
+Faster Approximation of Distances in Graphs
@@ Property / cites work: Faster Approximation of Distances in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A faster algorithm for betweenness centrality*
@@ Property / cites work: A faster algorithm for betweenness centrality* / rank @@
+Normal rank
@@ Property / cites work @@
+CENTRALITY ESTIMATION IN LARGE NETWORKS
@@ Property / cites work: CENTRALITY ESTIMATION IN LARGE NETWORKS / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time
+Normal rank
@@ Property / cites work @@
+More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
+Normal rank
@@ Property / cites work @@
+On <i>k</i>-Median clustering in high dimensions
@@ Property / cites work: On <i>k</i>-Median clustering in high dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
+Normal rank
@@ Property / cites work @@
+All-Pairs Small-Stretch Paths
@@ Property / cites work: All-Pairs Small-Stretch Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396583
@@ Property / cites work: Q3396583 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing betweenness centrality
@@ Property / cites work: Routing betweenness centrality / rank @@
+Normal rank
@@ Property / cites work @@
+All-Pairs Almost Shortest Paths
@@ Property / cites work: All-Pairs Almost Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Computing almost shortest paths
@@ Property / cites work: Computing almost shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
+Normal rank
@@ Property / cites work @@
+Fast Approximation of Centrality
@@ Property / cites work: Fast Approximation of Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Q3152421
@@ Property / cites work: Q3152421 / rank @@
+Normal rank
@@ Property / cites work @@
+All pairs shortest distances for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths for graphs with small integer length edges
+Normal rank
@@ Property / cites work @@
+Better Approximation of Betweenness Centrality
@@ Property / cites work: Better Approximation of Betweenness Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating average parameters of graphs
@@ Property / cites work: Approximating average parameters of graphs / rank @@
+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 coresets for k-means and k-median clustering
@@ Property / cites work: On coresets for k-means and k-median clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear time algorithms for metric space problems
+Normal rank
@@ Property / cites work @@
+A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem
+Normal rank
@@ Property / cites work @@
+Linear-time approximation schemes for clustering problems in any dimensions
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5526189
@@ Property / cites work: Q5526189 / rank @@
+Normal rank
@@ Property / cites work @@
+The centrality index of a graph
@@ Property / cites work: The centrality index of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:418725