Maximization problems on graphs with edge weights chosen from a normal distribution (Extended Abstract)
From MaRDI portal
Publication:5402536
DOI10.1145/800133.804327zbMath1282.68126OpenAlexW2105365164MaRDI QIDQ5402536
Publication date: 14 March 2014
Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800133.804327
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
This page was built for publication: Maximization problems on graphs with edge weights chosen from a normal distribution (Extended Abstract)