On the public citation graph
On-line network optimization problems
0 signed · 53 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.1006/jagm.1995.1005openalex-snapshot
Constructing Reliable Communication Networks of Small Weight Online
inferredcites →https://doi.org/10.1006/jcss.1995.1073openalex-snapshot
Competitive Algorithms for Distributed Data Management
inferredcites →https://doi.org/10.1007/3-540-54233-7_178openalex-snapshot
On-line algorithms for weighted bipartite matching and stable marriages
inferredcites →https://doi.org/10.1007/3-540-58218-5_4openalex-snapshot
Serving requests with on-line routing
inferredcites →https://doi.org/10.1007/3-540-60220-8_62openalex-snapshot
Online perfect matching and mobile computing
inferredcites →https://doi.org/10.1007/3-540-60220-8_63openalex-snapshot
Competitive algorithms for the on-line traveling salesman
inferredcites →https://doi.org/10.1007/3-540-60313-1_165openalex-snapshot
The online transportation problem
inferredcites →https://doi.org/10.1007/3-540-62034-6_49openalex-snapshot
An optimal deterministic algorithm for online b-matching
inferredcites →https://doi.org/10.1007/978-1-4020-9688-4_3openalex-snapshot
An analysis of several heuristics for the traveling salesman problem
inferredcites →https://doi.org/10.1007/bf02573969openalex-snapshot
On-line steiner trees in the Euclidean plane
inferredcites →https://doi.org/10.1016/0020-0190(91)90231-6openalex-snapshot
Online matching with blocked input
inferredcites →https://doi.org/10.1016/0020-0190(94)00116-2openalex-snapshot
Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space
inferredcites →https://doi.org/10.1016/0020-0190(95)00000-3openalex-snapshot
Linear bounds for on-line Steiner problems
inferredcites →https://doi.org/10.1016/0304-3975(94)90155-4openalex-snapshot
Constructing competitive tours from local information
inferredcites →https://doi.org/10.1016/0925-7721(93)90032-2openalex-snapshot
A competitive analysis of algorithms for searching unknown scenes
inferredcites →https://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1137/0206041openalex-snapshot
An Analysis of Several Heuristics for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1145/100216.100262openalex-snapshot
An optimal algorithm for on-line bipartite matching
inferredcites →https://doi.org/10.1145/129712.129717openalex-snapshot
Competitive algorithms for distributed data management (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258618openalex-snapshot
On-line algorithms for Steiner tree problems (extended abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_54openalex-snapshot
Online Matching for Scheduling Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_2openalex-snapshot
Deterministic Min-Cost Matching with Delays
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_33openalex-snapshot
Competitive Analysis for Two Variants of Online Metric Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_35openalex-snapshot
Online Bottleneck Semi-matching
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-319-18263-6_2openalex-snapshot
A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_14openalex-snapshot
The Online Matching Problem on a Line
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_47openalex-snapshot
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_20openalex-snapshot
The Online Transportation Problem: On the Exponential Boost of One Extra Server
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_36openalex-snapshot
The Online Metric Matching Problem for Doubling Metrics
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/s00224-019-09963-7openalex-snapshot
Deterministic Min-Cost Matching with Delays
inferred← citeshttps://doi.org/10.1007/s00453-012-9676-9openalex-snapshot
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/s10878-023-01036-3openalex-snapshot
Online bottleneck matching on a line
inferred← citeshttps://doi.org/10.1007/s10951-007-0037-5openalex-snapshot
A randomized algorithm for the on-line weighted bipartite matching problem
inferred← citeshttps://doi.org/10.1016/j.orl.2019.01.002openalex-snapshot
Greedy metric minimum online matchings with random arrivals
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00265-6openalex-snapshot
Online request server matching
inferred← citeshttps://doi.org/10.1109/sfcs.2005.12openalex-snapshot
AdWords and Generalized On-line Matching
inferred← citeshttps://doi.org/10.1142/s1793830921501561openalex-snapshot
Competitive analysis for two variants of online metric matching problem
inferred← citeshttps://doi.org/10.1145/1284320.1284321openalex-snapshot
AdWords and generalized online matching
inferred← citeshttps://doi.org/10.1145/2229012.2229043openalex-snapshot
Asymptotically optimal algorithm for stochastic adwords
inferred← citeshttps://doi.org/10.1145/305619.305623openalex-snapshot
Simple competitive request scheduling strategies
inferred← citeshttps://doi.org/10.1145/3594873openalex-snapshot
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.37openalex-snapshot
On the Power of Advice and Randomization for Online Bipartite Matching
inferred← citeshttps://doi.org/10.48550/arxiv.2105.12086openalex-snapshot
An $Ω(\log n)$ Lower Bound for Online Matching on the Line
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.