A lower bound for metric 1-median selection (Q340556): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6652738 / rank
 
Normal rank
Property / zbMATH Keywords
 
1-median selection
Property / zbMATH Keywords: 1-median selection / rank
 
Normal rank
Property / zbMATH Keywords
 
metric space
Property / zbMATH Keywords: metric space / rank
 
Normal rank
Property / zbMATH Keywords
 
sublinear-time algorithm
Property / zbMATH Keywords: sublinear-time algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
sublinear-query algorithm
Property / zbMATH Keywords: sublinear-query algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
query complexity
Property / zbMATH Keywords: query complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2400041466 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.2195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on approximate 1-median selection in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sublinear-time approximations for metric 1-median selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric 1-Median Selection: Query Complexity vs. Approximation Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation of Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating average parameters of graphs / 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 new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized query processing in robot path planning / 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: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating $k$-Median via Pseudo-Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time bounds for approximate clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Complexity of Monotone Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating metric 1-median in sublinear time / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:22, 12 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for metric 1-median selection
scientific article

    Statements

    A lower bound for metric 1-median selection (English)
    0 references
    0 references
    14 November 2016
    0 references
    1-median selection
    0 references
    metric space
    0 references
    sublinear-time algorithm
    0 references
    sublinear-query algorithm
    0 references
    query complexity
    0 references

    Identifiers

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