类人猿
发表于 2025-3-26 22:40:02
http://reply.papertrans.cn/17/1605/160425/160425_31.png
FISC
发表于 2025-3-27 03:51:20
http://reply.papertrans.cn/17/1605/160425/160425_32.png
Brocas-Area
发表于 2025-3-27 07:36:26
,Über Tuberkuloseschutzimpfungen, is .. We present a local-search-based PTAS for . in terrain-like graphs. Then, we observe that, besides the visibility graphs of .-monotone terrains which are terrain-like, so are the visibility graphs of . and ., immediately implying a PTAS for guarding the vertices of such a polygon or terrain fr
myocardium
发表于 2025-3-27 09:35:18
http://reply.papertrans.cn/17/1605/160425/160425_34.png
Excise
发表于 2025-3-27 16:06:26
https://doi.org/10.1007/978-3-662-33025-8most . edges are blocked. The traveller, guided by a strategy, sees an edge is blocked when he visits one of its endpoints. A major result established by Westphal is that the competitive ratio of any deterministic strategy for this problem is at least .. . and . strategies achieve this bound..We ref
Paradox
发表于 2025-3-27 21:17:33
https://doi.org/10.1007/978-3-662-33025-8 of competitive algorithms for dynamic problems, where objects can also depart from the instance. In this work, we give a general framework to obtain so called robust online algorithms for a variety of dynamic problems: these online algorithms achieve an asymptotic competitive ratio of . with migrat
出生
发表于 2025-3-28 01:10:40
https://doi.org/10.1007/978-3-662-33025-8 the model we consider, which goes back to [.], once the schedule is defined an adversary can pick a scenario where deviation is added to some of the jobs’ processing times. Given only the maximal cardinality of these jobs, and the magnitude of potential deviation for each job, the goal is to optimi
carotenoids
发表于 2025-3-28 02:05:37
https://doi.org/10.1007/978-3-662-33025-8rial optimization. These are well understood in the traditional online and offline cases, but have been less well-studied when the volume of the input is truly massive, and cannot even be read into memory. This is captured by the streaming model of computation, where the aim is to approximate the co
inflate
发表于 2025-3-28 07:16:42
https://doi.org/10.1007/978-3-662-33025-8d theorists alike. Given an undirected cycle on . nodes together with non-negative demands between any pair of nodes, the . asks for an unsplittable routing of the demands such that the maximum cumulated demand on any edge is minimized. Let . be the value of such a solution. In the relaxed version o
EXCEL
发表于 2025-3-28 13:15:40
https://doi.org/10.1007/978-3-642-92389-0nts forms a .-.. For any given time and input sequence, the overall performance is determined by the best of the . individual total results. Problems of this type have been considered for online makespan minimization; they are also related to optimization with . on future events, i.e., a number of b