Dynamic TCP acknowledgement and other stories about e/(e-1)

DOI10.1145/380752.380845zbMath1323.68300OpenAlexW1980535356MaRDI QIDQ5176008

Anna R. Karlin, Dana Randall, Claire M. Kenyon

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380845

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Online scheduling with partial job values: does timesharing or randomization help? ⋮ Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm ⋮ Randomized competitive analysis for two server problems ⋮ Randomized Competitive Analysis for Two-Server Problems ⋮ On the best possible competitive ratio for the multislope ski-rental problem ⋮ Algorithms for energy conservation in heterogeneous data centers

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Dynamic TCP acknowledgement and other stories about e/(e-1)