Dear Colleagues,
We would like to invite scientific articles on the topic "Design of Online and Approximation Algorithms". Online and approximation algorithms require fundamental research in order to deal with situations where the algorithm capability is limited: online algorithms have limited knowledge of the whole input and have to make irrevocable decisions, while approximation algorithms have limited computational power to find an optimal solution. Both problems arise from both theoretical interest and practical concern in a variety of areas.
For this Special Issue of Algorithms, we would like to invite articles on paradigms to design and analyze online and approximation algorithms. We are looking for manuscripts of online/approximation algorithms, competitive analysis and beyond, distributed and parallel approximation/online algorithms, hardness of approximation/competitiveness, parameterized approximation/online algorithms, etc. We welcome manuscripts using different problem-solving frameworks (mathematical programming methods, embeddings and metric space methods, etc.) or approaches that go beyond worst-case analysis.
**The submission deadline is 30th November 2021.**
For more details, please find:
https://www.mdpi.com/journal/algorithms/special_issues/online_approx_algo
Prof. Dr. Prudence W.H. Wong
Dr. Hsiang-Hsuan Liu
Guest Editors
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************