On the public citation graph
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance
0 signed · 45 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.1002/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
inferredcites →https://doi.org/10.1007/11496915_15openalex-snapshot
LP-Based Online Scheduling: From Single to Parallel Machines
inferredcites →https://doi.org/10.1007/11533719_74openalex-snapshot
On the Power of Lookahead in On-Line Vehicle Routing Problems
inferredcites →https://doi.org/10.1007/11534273_27openalex-snapshot
The On-line Asymmetric Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/11609773_26openalex-snapshot
Totally Clairvoyant Scheduling with Relative Timing Constraints
inferredcites →https://doi.org/10.1007/3-540-44683-4_43openalex-snapshot
News from the Online Traveling Repairman
inferredcites →https://doi.org/10.1007/3-540-45749-6_59openalex-snapshot
On-Line Dial-a-Ride Problems under a Restricted Information Model
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/3-540-46521-9_11openalex-snapshot
The Online Dial-a-Ride Problem under Reasonable Load
inferredcites →https://doi.org/10.1007/3-540-47867-1_17openalex-snapshot
The Minimum Latency Problem Is NP-Hard for Weighted Trees
inferredcites →https://doi.org/10.1007/bf01585867openalex-snapshot
An improved approximation ratio for the minimum latency problem
inferredcites →https://doi.org/10.1007/pl00009158openalex-snapshot
On the Influence of Lookahead in Competitive Paging Algorithms
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1016/0020-0190(91)90231-6openalex-snapshot
Online matching with blocked input
inferredcites →https://doi.org/10.1016/0304-3975(94)90151-1openalex-snapshot
Nonclairvoyant scheduling
inferredcites →https://doi.org/10.1016/j.ipl.2004.06.013openalex-snapshot
Algorithms for the On-Line Quota Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/j.tcs.2004.05.023openalex-snapshot
Semi-clairvoyant scheduling
inferredcites →https://doi.org/10.1016/s0167-6377(97)00040-0openalex-snapshot
Scheduling on identical machines: How good is LPT in an on-line setting?
inferredcites →https://doi.org/10.1016/s0304-3975(00)00261-9openalex-snapshot
On-line single-server dial-a-ride problems
inferredcites →https://doi.org/10.1016/s0304-3975(02)00409-7openalex-snapshot
News from the online traveling repairman
inferredcites →https://doi.org/10.1016/s0304-3975(97)00026-1openalex-snapshot
A competitive analysis of the list update problem with lookahead
inferredcites →https://doi.org/10.1051/ita/1986200100791openalex-snapshot
The complexity of the travelling repairman problem
inferredcites →https://doi.org/10.1109/sfcs.1996.548489openalex-snapshot
A 3-approximation for the minimum tree spanning k vertices
inferredcites →https://doi.org/10.1145/1008731.1008732openalex-snapshot
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1147/sj.52.0078openalex-snapshot
A study of replacement algorithms for a virtual-storage computer
inferredcites →https://doi.org/10.1287/ijoc.13.2.138.10517openalex-snapshot
The Online TSP Against Fair Adversaries
inferredcites →https://doi.org/10.1287/trsc.1060.0147openalex-snapshot
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
inferredcites →https://doi.org/10.5555/313651.313781openalex-snapshot
Online bin packing with lookahead
inferredcites →https://doi.org/10.6100/ir558972openalex-snapshot
Complexity results and competitive analysis for vehicle routing problems
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-0-387-77778-8_10openalex-snapshot
Online Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-18367-6_8openalex-snapshot
An Improved Algorithm for Open Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_4openalex-snapshot
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1007/s12351-019-00506-zopenalex-snapshot
Online optimization with gradual look-ahead
inferred← citeshttps://doi.org/10.1080/23302674.2022.2141590openalex-snapshot
Exact reoptimisation under gradual look-ahead for operational control in production and logistics
inferred← citeshttps://doi.org/10.1109/icamimia60881.2023.10427632openalex-snapshot
Examining the Online Food Delivery Problem on Starlike Graphs
inferred← citeshttps://doi.org/10.1137/24m1657833openalex-snapshot
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride
inferred← citeshttps://doi.org/10.1287/opre.1070.0450openalex-snapshot
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
inferred← citeshttps://doi.org/10.20965/jaciii.2011.p1199openalex-snapshot
WIN Algorithm for Discrete Online TSP
inferred← citeshttps://doi.org/10.5957/jspd.29.2.120045openalex-snapshot
Block Erection Sequencing in Shipbuilding With General Lifting and Joining Times
inferred← citeshttps://doi.org/10.70675/8fa1b961za441z4dc6zba7fzb593312660acopenalex-snapshot
Models and algorithms for fleet management of autonomous vehicles
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.