Titlebook: Approximation and Online Algorithms; 17th International W Evripidis Bampis,Nicole Megow Conference proceedings 2020 Springer Nature Switzer

宗派

書目名稱Approximation and Online Algorithms影響因子(影響力)




書目名稱Approximation and Online Algorithms影響因子(影響力)學(xué)科排名




書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度




書目名稱Approximation and Online Algorithms網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Approximation and Online Algorithms被引頻次




書目名稱Approximation and Online Algorithms被引頻次學(xué)科排名




書目名稱Approximation and Online Algorithms年度引用




書目名稱Approximation and Online Algorithms年度引用學(xué)科排名




書目名稱Approximation and Online Algorithms讀者反饋




書目名稱Approximation and Online Algorithms讀者反饋學(xué)科排名

不溶解

你正派

,Improved Deterministic Strategy for the Canadian Traveller Problem Exploiting Small Max-(,,?,)-Cutsmost . 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

不成比例

Robust Online Algorithms for Certain Dynamic Packing Problems, 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

Infusion

Approximation Results for Makespan Minimization with Budgeted Uncertainty, 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

環(huán)形

Streaming Algorithms for Bin Packing and Vector Scheduling,rial 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

–FER

An Improved Upper Bound for the Ring Loading Problem,d 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

indemnify

小口啜飲

Vital-Signs

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms,links of minimum cardinality whose addition to the graph makes it .-edge-connected. There is an approximation preserving reduction from the mentioned problem to the case . (a.k.a. the Tree Augmentation Problem or TAP) or . (a.k.a. the Cactus Augmentation Problem or CacAP). While several better-than-