For generalized delay costs in online TCP acknowledgment, the greedy algorithm is 2-competitive under batch-oblivious submodular or ℓ_p costs and under batch-aware max costs, but the deterministic competitive ratio becomes Θ(log n) for batch-aware sum costs assuming only monotonicity of the per-pach
General framework for metric optimization problems with delay or with deadlines
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Online TCP Acknowledgment under General Delays
For generalized delay costs in online TCP acknowledgment, the greedy algorithm is 2-competitive under batch-oblivious submodular or ℓ_p costs and under batch-aware max costs, but the deterministic competitive ratio becomes Θ(log n) for batch-aware sum costs assuming only monotonicity of the per-pach