On the public citation graph

Facility Location in Sublinear Time

0 signed · 54 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.1006/jagm.1998.0993openalex-snapshot
Greedy Strikes Back: Improved Facility Location Algorithms
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-44436-xopenalex-snapshot
Approximation Algorithms for Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-45753-4_20openalex-snapshot
Improved Approximation Algorithms for Metric Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-48224-5_16openalex-snapshot
Approximating the Minimum Spanning Tree Weight in Sublinear Time
inferredcites →https://doi.org/10.1007/3-540-69346-7_14openalex-snapshot
Improved Approximation Algorithms for Uncapacitated Facility Location
inferredcites →https://doi.org/10.1007/978-3-662-12788-9_6openalex-snapshot
Concentration
inferredcites →https://doi.org/10.1109/sffcs.1999.814587openalex-snapshot
A sublinear time approximation scheme for clustering in metric spaces
inferredcites →https://doi.org/10.1109/sffcs.1999.814609openalex-snapshot
Improved combinatorial algorithms for the facility location and k-median problems
inferredcites →https://doi.org/10.1137/s0097539701383443openalex-snapshot
The Online Median Problem
inferredcites →https://doi.org/10.1137/s0097539701388884openalex-snapshot
Quick k -Median, k -Center, and Facility Location for Sparse Graphs
inferredcites →https://doi.org/10.1137/s0097539702403244openalex-snapshot
Approximating the Minimum Spanning Tree Weight in Sublinear Time
inferredcites →https://doi.org/10.1145/1007352.1007386openalex-snapshot
Estimating the weight of metric minimum spanning trees in sublinear-time
inferredcites →https://doi.org/10.1145/258533.258600openalex-snapshot
Approximation algorithms for facility location problems (extended abstract)
inferredcites →https://doi.org/10.1145/301250.301366openalex-snapshot
Sublinear time algorithms for metric space problems
inferredcites →https://doi.org/10.1145/375827.375845openalex-snapshot
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
inferredcites →https://doi.org/10.1145/509907.510012openalex-snapshot
A new greedy approach for facility location problems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20203openalex-snapshot
Approximating average parameters of graphs
inferred← citeshttps://doi.org/10.1007/11672142_50openalex-snapshot
Memoryless Facility Location in One Pass
inferred← citeshttps://doi.org/10.1007/11830924_34openalex-snapshot
Approximating Average Parameters of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_703openalex-snapshot
Estimating Simple Graph Parameters in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_34openalex-snapshot
The Kinetic Facility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_46openalex-snapshot
Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_8openalex-snapshot
Separating Sublinear Time Computations by Approximate Diameter
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_55openalex-snapshot
Facility Location in Dynamic Geometric Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_7openalex-snapshot
Fast Approximation in Subspaces by Doubling Metric Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_5openalex-snapshot
Sublinear-time Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_703-1openalex-snapshot
Estimating Simple Graph Parameters in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-28209-6_3openalex-snapshot
Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_39openalex-snapshot
Super-Fast Distributed Algorithms for Metric Facility Location
inferred← citeshttps://doi.org/10.1007/s00224-009-9235-1openalex-snapshot
Small Space Representations for Metric Min-sum k-Clustering and Their Applications
inferred← citeshttps://doi.org/10.1007/s00446-015-0243-xopenalex-snapshot
Sub-logarithmic distributed algorithms for metric facility location
inferred← citeshttps://doi.org/10.1007/s00453-008-9250-7openalex-snapshot
Kinetic Facility Location
inferred← citeshttps://doi.org/10.1007/s00453-012-9690-yopenalex-snapshot
A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem
inferred← citeshttps://doi.org/10.1007/s10878-009-9248-3openalex-snapshot
Separating sublinear time computations by approximate diameter
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.02.003openalex-snapshot
Deterministic sublinear-time approximations for metric 1-median selection
inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.009openalex-snapshot
A concentration inequality for the facility location problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.040openalex-snapshot
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.006openalex-snapshot
A sublinear-time approximation scheme for bin packing
inferred← citeshttps://doi.org/10.1080/02522667.2021.1930657openalex-snapshot
QUBO formulations of three NP problems
inferred← citeshttps://doi.org/10.1109/focs.2008.81openalex-snapshot
Constant-Time Approximation Algorithms via Local Improvements
inferred← citeshttps://doi.org/10.1109/focs.2018.00011openalex-snapshot
Metric Sublinear Algorithms via Linear Sampling
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00050openalex-snapshot
Streaming Facility Location in High Dimension via Geometric Hashing
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00023openalex-snapshot
Fully Dynamic $k-\text{Clustering}$ with Fast Update Time and Small Recourse
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470349openalex-snapshot
A local, distributed constant-factor approximation algorithm for the dynamic facility location problem
inferred← citeshttps://doi.org/10.1137/1.9781611975994.180openalex-snapshot
Sublinear time approximation of the cost of a metric k-nearest neighbor graph
inferred← citeshttps://doi.org/10.1145/1148109.1148152openalex-snapshot
A distributed O (1)-approximation algorithm for the uniform facility location problem
inferred← citeshttps://doi.org/10.1145/2000807.2000817openalex-snapshot
Memoryless facility location in one pass
inferred← citeshttps://doi.org/10.1145/3717823.3718176openalex-snapshot
Fully Dynamic 𝑘-Median with Near-Optimal Update Time and Recourse
inferred← citeshttps://doi.org/10.17877/de290r-8506openalex-snapshot
Approximation Techniques for Facility Location and Their Applications in Metric Embeddings
inferred← citeshttps://doi.org/10.48550/arxiv.1105.1248openalex-snapshot
A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2473openalex-snapshot
Super-Fast Distributed Algorithms for Metric Facility Location
inferred← citeshttps://doi.org/10.48550/arxiv.1807.03839openalex-snapshot
Online Facility Location with Deletions
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09302openalex-snapshot
Metric Sublinear Algorithms via Linear Sampling
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.