Some results on approximate 1-median selection in metric spaces (Q418725): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Approximation of Distances in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: CENTRALITY ESTIMATION IN LARGE NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs shortest paths for unweighted undirected graphs in <i>o(mn)</i> time / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Algorithms for All-Pairs Shortest Paths in Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>k</i>-Median clustering in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Small-Stretch Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing betweenness centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation of Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest distances for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation of Betweenness Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating average parameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coresets for k-means and k-median clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear time algorithms for metric space problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time approximation schemes for clustering problems in any dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centrality index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796165 / rank
 
Normal rank

Latest revision as of 06:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Some results on approximate 1-median selection in metric spaces
scientific article

    Statements

    Some results on approximate 1-median selection in metric spaces (English)
    0 references
    0 references
    30 May 2012
    0 references
    closeness centrality
    0 references
    1-median
    0 references
    metric space
    0 references
    query complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references