id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
cord-025439-3rlvmwce	Christman, Ananya	New Bounds for Maximizing Revenue in Online Dial-a-Ride	2020-04-30		.txt	text/plain	6144	433	78	We then investigate the problem for uniform revenues (so the objective is to maximize the total number of requests served) and prove that sbp earns at least 1/4 the revenue of opt, minus an additive term linear in f , the number of time segments (Sect. It was observed in [8] that no deterministic online algorithm can be guaranteed to serve the requests served by opt during the last time segment and the authors proved that sbp is 6-competitive barring an additive factor equal to the revenue earned by opt during the last two time segments. We first present a general lower bound for this problem and show that no non-preemptive deterministic online algorithm (e.g. sbp) can be better than 2-competitive with respect to the revenue earned by the offline optimal schedule (ignoring the last two time segments; see Lemma 1, below).	./cache/cord-025439-3rlvmwce.txt	./txt/cord-025439-3rlvmwce.txt