On the public citation graph

Online Traveling Salesmen Should Travel Randomly: A Randomized Zealous Algorithm for the Online Tsp on the Line

https://doi.org/10.2139/ssrn.4903580
0 signed · 12 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/net.20454openalex-snapshot
Online traveling salesman problems with service flexibility
inferredcites →https://doi.org/10.1002/net.21559openalex-snapshot
Online traveling salesman problems with rejection options
inferredcites →https://doi.org/10.1007/3-540-45753-4_18openalex-snapshot
Non-Abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-030-14812-6_20openalex-snapshot
Online Travelling Salesman Problem on a Circle
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_32openalex-snapshot
Algorithms for the On-Line Quota Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1016/j.ipl.2008.03.002openalex-snapshot
The online Prize-Collecting Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/j.jda.2007.03.002openalex-snapshot
The on-line asymmetric traveling salesman problem
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/3422362openalex-snapshot
Tight Bounds for Online TSP on the Line
inferredcites →https://doi.org/10.1287/ijoc.13.2.138.10517openalex-snapshot
The Online TSP Against Fair Adversaries
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.