On the public citation graph

A lower bound for metric 1-median selection

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.20203openalex-snapshot
Approximating average parameters of graphs
inferredcites →https://doi.org/10.1006/jcss.1998.1578openalex-snapshot
Randomized Query Processing in Robot Path Planning
inferredcites →https://doi.org/10.1007/978-3-642-32241-9_2openalex-snapshot
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems
inferredcites →https://doi.org/10.1007/s00453-013-9833-9openalex-snapshot
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems
inferredcites →https://doi.org/10.1016/j.ic.2012.01.007openalex-snapshot
A 1.488 approximation algorithm for the uncapacitated facility location problem
inferredcites →https://doi.org/10.1016/j.ipl.2013.02.003openalex-snapshot
Deterministic sublinear-time approximations for metric 1-median selection
inferredcites →https://doi.org/10.1016/j.ipl.2013.12.004openalex-snapshot
On approximating metric 1-median in sublinear time
inferredcites →https://doi.org/10.1016/j.tcs.2011.12.003openalex-snapshot
Some results on approximate 1-median selection in metric spaces
inferredcites →https://doi.org/10.1016/j.tcs.2015.07.058openalex-snapshot
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
inferredcites →https://doi.org/10.1023/b:mach.0000033114.18632.e0openalex-snapshot
Optimal Time Bounds for Approximate Clustering
inferredcites →https://doi.org/10.1109/tkde.2003.1198387openalex-snapshot
Clustering data streams: theory and practice
inferredcites →https://doi.org/10.1137/070699007openalex-snapshot
On Coresets for k -Median and k -Means Clustering in Metric and Euclidean Spaces and Their Applications
inferredcites →https://doi.org/10.1137/120888703openalex-snapshot
A Lower Bound for the Complexity of Monotone Graph Properties
inferredcites →https://doi.org/10.1137/130938645openalex-snapshot
Approximating $k$-Median via Pseudo-Approximation
inferredcites →https://doi.org/10.1137/s0097539702416402openalex-snapshot
Local Search Heuristics for k -Median and Facility Location Problems
inferredcites →https://doi.org/10.1145/1667053.1667054openalex-snapshot
Linear-time approximation schemes for clustering problems in any dimensions
inferredcites →https://doi.org/10.1145/301250.301366openalex-snapshot
Sublinear time algorithms for metric space problems
inferredcites →https://doi.org/10.1145/3154858openalex-snapshot
Metric 1-Median Selection
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1145/509907.510012openalex-snapshot
A new greedy approach for facility location problems
inferredcites →https://doi.org/10.7155/jgaa.00081openalex-snapshot
Fast Approximation of Centrality

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_18openalex-snapshot
Deterministic Metric 1-median Selection with a $$1-o(1)$$ Fraction of Points Ignored
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_11openalex-snapshot
Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.058openalex-snapshot
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114720openalex-snapshot
Deterministic metric 1-median selection with very few queries
inferred← citeshttps://doi.org/10.1080/02331934.2024.2335946openalex-snapshot
A linear-time approximation algorithm for the minimum-length geometric embedding of trees
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00134openalex-snapshot
Resolving the Optimal Metric Distortion Conjecture
inferred← citeshttps://doi.org/10.1109/icasi.2017.7988144openalex-snapshot
Metric 1-median selection with fewer queries
inferred← citeshttps://doi.org/10.1145/3154858openalex-snapshot
Metric 1-Median Selection
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03106openalex-snapshot
A Las Vegas approximation algorithm for metric $1$-median selection
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08433openalex-snapshot
Metric random matchings with applications
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.