Articles with public access mandates - Michel GoemansLearn more
Available somewhere: 5
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
A Asadpour, MX Goemans, A Mądry, SO Gharan, A Saberi
Operations Research 65 (4), 1043-1061, 2017
Mandates: US National Science Foundation, US Department of Defense
Polynomiality for bin packing with a constant number of item types
MX Goemans, T Rothvoß
Journal of the ACM (JACM) 67 (6), 1-21, 2020
Mandates: US National Science Foundation, US Department of Defense
Community detection in hypergraphs, spiked tensor models, and sum-of-squares
C Kim, AS Bandeira, MX Goemans
2017 International Conference on Sampling Theory and Applications (SampTA …, 2017
Mandates: US National Science Foundation, US Department of Defense
Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
WC Cheung, MX Goemans, SC Wong
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
Mandates: A*Star, Singapore
A flow model based on polylinking system
MX Goemans, S Iwata, R Zenklusen
Mathematical programming 135 (1), 1-23, 2012
Mandates: Swiss National Science Foundation
Publication and funding information is determined automatically by a computer program