Towards asymptotic optimality in probabilistic packet marking
From MaRDI portal
Publication:3581439
DOI10.1145/1060590.1060657zbMath1192.68017OpenAlexW2068069756MaRDI QIDQ3581439
Jeff Edmonds, Micah Adler, Ji{ří} Matoušek
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060657
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items (2)
On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\) ⋮ On the nonexistence of \(k\)-reptile tetrahedra
This page was built for publication: Towards asymptotic optimality in probabilistic packet marking
