Approximation and Online Algorithms
portes grátis
Approximation and Online Algorithms
20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings
Chalermsook, Parinya; Laekhanukit, Bundit
Springer International Publishing AG
10/2022
255
Mole
Inglês
9783031183669
15 a 20 dias
415
Descrição não disponível.
Locating Service and Charging stations.- Graph burning and non-uniform $k$-centers for small treewidth.- Scheduling with Machine Conflicts.- Knapsack Secretary Through Boosting.- Scheduling Appointments Online: The Power of Deferred Decision-Making.- Canadian Traveller Problem with Predictions.- The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride.- Stochastic graph exploration with limited resources.- Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem.- On Streaming Algorithms for Geometric Independent Set and Clique.- Approximating Length-Restricted Means under Dynamic Time Warping.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;combinatorial optimization;computer networks;graph theory;correlation analysis;online algorithms;graph algorithms and analysis;adaptive algorithms;scheduling algorithms;streaming algorithms;stochastic approximation;theoretical computer science;approximation theory;competitive ratio;graphic methods;mathematics;numerical model;on-line algorithms;polynomial approximation;probability
Locating Service and Charging stations.- Graph burning and non-uniform $k$-centers for small treewidth.- Scheduling with Machine Conflicts.- Knapsack Secretary Through Boosting.- Scheduling Appointments Online: The Power of Deferred Decision-Making.- Canadian Traveller Problem with Predictions.- The Power of Amortized Recourse for Online Graph Problems- An Improved Algorithm for Open Online Dial-a-Ride.- Stochastic graph exploration with limited resources.- Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem.- On Streaming Algorithms for Geometric Independent Set and Clique.- Approximating Length-Restricted Means under Dynamic Time Warping.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
approximation algorithms;combinatorial optimization;computer networks;graph theory;correlation analysis;online algorithms;graph algorithms and analysis;adaptive algorithms;scheduling algorithms;streaming algorithms;stochastic approximation;theoretical computer science;approximation theory;competitive ratio;graphic methods;mathematics;numerical model;on-line algorithms;polynomial approximation;probability
