On the public citation graph
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm
0 signed · 25 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/978-3-319-77404-6_5openalex-snapshot
A Collection of Lower Bounds for Online Matching on the Line
inferredcites →https://doi.org/10.1007/978-3-540-24592-6_14openalex-snapshot
The Online Matching Problem on a Line
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_36openalex-snapshot
The Online Metric Matching Problem for Doubling Metrics
inferredcites →https://doi.org/10.1007/bfb0029573openalex-snapshot
On-line network optimization problems
inferredcites →https://doi.org/10.1007/s00453-019-00565-wopenalex-snapshot
A $${o}\mathopen {}\left( n\right) \mathclose {}$$-Competitive Deterministic Algorithm for Online Matching on a Line
inferredcites →https://doi.org/10.1016/0304-3975(94)90042-6openalex-snapshot
On-line algorithms for weighted bipartite matching and stable marriages
inferredcites →https://doi.org/10.1109/focs.2017.53openalex-snapshot
An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem
inferredcites →https://doi.org/10.1137/s0895480198342310openalex-snapshot
The Online Transportation Problem
inferredcites →https://doi.org/10.1145/2902945.2902960openalex-snapshot
SIGACT News Online Algorithms Column 27
inferredcites →https://doi.org/10.1145/3582689openalex-snapshot
Online Metric Algorithms with Untrusted Predictions
inferredcites →https://doi.org/10.4230/lipics.approx/random.2020.37openalex-snapshot
Online Minimum Cost Matching with Recourse on the Line
inferredcites →https://doi.org/10.4230/lipics.approx/random.2020.40openalex-snapshot
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
inferredcites →https://doi.org/10.4230/lipics.socg.2018.67openalex-snapshot
Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line
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-86593-1_5openalex-snapshot
A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_23openalex-snapshot
Online Facility Assignment for General Layout of Servers on a Line
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_6openalex-snapshot
Stochastic Online Metric Matching: Adversarial Is No Harder Than Stochastic
inferred← citeshttps://doi.org/10.1007/978-981-96-1490-5_2openalex-snapshot
Online Bottleneck Matching on a Ring
inferred← citeshttps://doi.org/10.1007/978-981-97-7801-0_11openalex-snapshot
Online Bottleneck Matching on a Star
inferred← citeshttps://doi.org/10.1007/978-981-99-9772-5_10openalex-snapshot
Mechanism Design for Mobility
inferred← citeshttps://doi.org/10.1007/s00453-025-01299-8openalex-snapshot
Online Metric Matching on the Line with Recourse
inferred← citeshttps://doi.org/10.1007/s10878-023-01036-3openalex-snapshot
Online bottleneck matching on a line
inferred← citeshttps://doi.org/10.1016/j.orl.2026.107484openalex-snapshot
Permutation for online metric matching with m distinct servers
inferred← citeshttps://doi.org/10.1287/opre.2025.1646openalex-snapshot
Online Metric Matching: Beyond the Worst Case
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.