On the public citation graph
Memoryless Facility Location in One Pass
0 signed · 30 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11523468_70openalex-snapshot
Facility Location in Sublinear Time
inferredcites →https://doi.org/10.1007/3-540-45061-0_51openalex-snapshot
On the Competitive Ratio for Online Facility Location
inferredcites →https://doi.org/10.1007/978-3-540-30140-0_32openalex-snapshot
Incremental Algorithms for Facility Location and k-Median
inferredcites →https://doi.org/10.1016/j.ic.2004.06.002openalex-snapshot
A simple and deterministic competitive algorithm for online facility location
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tkde.2003.1198387openalex-snapshot
Clustering data streams: theory and practice
inferredcites →https://doi.org/10.1137/s0097539701388884openalex-snapshot
Quick k -Median, k -Center, and Facility Location for Sparse Graphs
inferredcites →https://doi.org/10.1145/1007352.1007413openalex-snapshot
Algorithms for dynamic geometric problems over data streams
inferredcites →https://doi.org/10.1145/1060590.1060622openalex-snapshot
Coresets in dynamic geometric data streams
inferredcites →https://doi.org/10.1145/258533.258657openalex-snapshot
Incremental clustering and dynamic information retrieval
inferredcites →https://doi.org/10.1145/780542.780548openalex-snapshot
Better streaming algorithms for clustering problems
inferredcites →https://doi.org/10.1145/780547.780548openalex-snapshot
Better streaming algorithms for clustering problems
inferredcites →https://doi.org/10.1561/9781933019604openalex-snapshot
Data Streams: Algorithms and Applications
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-540-87744-8_55openalex-snapshot
Facility Location in Dynamic Geometric Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-88069-1_9openalex-snapshot
Dealing with Large Datasets Using an Artificial Intelligence Clustering Tool
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_26openalex-snapshot
Online Clustering with Variable Sized Clusters
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/s00453-011-9586-2openalex-snapshot
Online Clustering with Variable Sized Clusters
inferred← citeshttps://doi.org/10.1007/s10100-010-0153-8openalex-snapshot
Online facility location with facility movements
inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470409openalex-snapshot
Algorithmic mechanisms for internet-based master-worker computing with untrusted and selfish workers
inferred← citeshttps://doi.org/10.1109/nca.2008.41openalex-snapshot
Designing Mechanisms for Reliable Internet-based Computing
inferred← citeshttps://doi.org/10.1109/tc.2012.186openalex-snapshot
Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
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/1959045.1959065openalex-snapshot
Online and incremental algorithms for facility location
inferred← citeshttps://doi.org/10.14232/actacyb.21.1.2013.6openalex-snapshot
Online Clustering on the Line with Square Cost Variable Sized Clusters
inferred← citeshttps://doi.org/10.14569/ijacsa.2018.090738openalex-snapshot
Intrusion Detection and Prevention Systems as a Service in Could-based Environment
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.1307.1650openalex-snapshot
Algorithmic Mechanisms for Reliable Internet-based Computing under Collusion
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.