A Match in Time Saves Nine: Deterministic Online Matching with Delays-Reference-Cited by-同舟云学术

A Match in Time Saves Nine: Deterministic Online Matching with Delays

Published:2018 Issue: Volume: Page:132-146
ISSN:0302-9743
Container-title:Approximation and Online Algorithms
language:
Short-container-title:

Author:

Bienkowski Marcin^ORCID,Kraska Artur,Schmidt Paweł

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-89441-6_11

Reference44 articles.

1. Albers, S., Bals, H.: Dynamic TCP acknowledgment: penalizing long delays. SIAM J. Discret. Math. 19(4), 938–951 (2005)

2. Lecture Notes in Computer Science;A Antoniadis,2015

3. Ashlagi, I., Azar, Y., Charikar, M., Chiplunkar, A., Geri, O., Kaplan, H., Makhijani, R.M., Wang, Y., Wattenhofer, R.: Min-cost bipartite perfect matching with delays. In: Proceedings of the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 1:1–1:20 (2017)

4. Avontuur, T., Spronck, P., van Zaanen, M.: Player skill modeling in Starcraft II. In: Proceedings of the 9th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE-2013 (2013)

5. Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost (bipartite) perfect matching with delays (2016). https://arxiv.org/abs/1610.05155

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On bin packing with clustering and bin packing with delays;Discrete Optimization;2021-08

2. Deterministic Min-Cost Matching with Delays;Theory of Computing Systems;2020-01-06

3. The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays;The 31st ACM Symposium on Parallelism in Algorithms and Architectures;2019-06-17

4. A Primal-Dual Online Deterministic Algorithm for Matching with Delays;Approximation and Online Algorithms;2018

5. Deterministic Min-Cost Matching with Delays;Approximation and Online Algorithms;2018