Separating subadditive euclidean functionals

DOI10.1145/2897518.2897571zbMath1375.90250arXiv1501.01944OpenAlexW1914315659MaRDI QIDQ5361816

Wesley Pegden, Alan M. Frieze

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.01944

zbMATH Keywords

probabilistic analysisEuclidean functionals

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial probability (60C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Separating subadditive euclidean functionals