Michel Goemans

Citat de

	Toate	Din 2019
Referințe bibliografice	16612	4252
h-index	50	33
i10-index	88	54

780

390

195

585

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202491 161 144 237 342 239 255 385 389 358 411 516 512 609 580 617 658 687 650 686 707 665 702 659 759 610 690 710 729 763 749

Acces public

Afișați-le pe toate

5 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

David P. WilliamsonProfessor of Operations Research, Cornell UniversityAdresă de e-mail confirmată pe cornell.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchAdresă de e-mail confirmată pe google.com
Brian DeanProfessor of Computer Science, Clemson UniversityAdresă de e-mail confirmată pe clemson.edu
Satoru IwataUniversity of TokyoAdresă de e-mail confirmată pe mist.i.u-tokyo.ac.jp
Rico ZenklusenETH ZurichAdresă de e-mail confirmată pe math.ethz.ch
Aleksander MądryMITAdresă de e-mail confirmată pe mit.edu
Martin SkutellaEinstein Professor of Mathematics and Computer Science, TU BerlinAdresă de e-mail confirmată pe tu-berlin.de
Eva TardosProfessor of Computer Science, Cornell UniversityAdresă de e-mail confirmată pe cornell.edu
Nicholas J. A. HarveyProfessor of Computer Science, University of British ColumbiaAdresă de e-mail confirmată pe cs.ubc.ca
Jon KleinbergProfessor of Computer Science, Cornell UniversityAdresă de e-mail confirmată pe cs.cornell.edu
Adrian VettaProfessor of Mathematics/ Professor of Computer Science, McGill UniversityAdresă de e-mail confirmată pe math.mcgill.ca
Thomas RothvossUniversity of WashingtonAdresă de e-mail confirmată pe math.mit.edu
Michael RosenblumProfessor of Biostatistics, Johns Hopkins UniversityAdresă de e-mail confirmată pe jhsph.edu
Daniel BienstockLiu Family Professor of Operations Research and Applied Mathematics, Columbia UniversityAdresă de e-mail confirmată pe columbia.edu
Franz RendlMathematik, Alpen-Adria Universität KlagenfurtAdresă de e-mail confirmată pe aau.at
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Adresă de e-mail confirmată pe alum.mit.edu
David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceAdresă de e-mail confirmată pe cs.cornell.edu
Shayan Oveis GharanAssociate Professor, University of WashingtonAdresă de e-mail confirmată pe cs.washington.edu
Naveen GargComputer Science and Engineering, IIT DelhiAdresă de e-mail confirmată pe cse.iitd.ac.in
Li Erran LiIEEE Fellow and ACM Fellow, AWS AI, AmazonAdresă de e-mail confirmată pe cs.columbia.edu

Urmăriți

Michel Goemans

RSA Professor of Mathematics, MIT

Adresă de e-mail confirmată pe math.mit.edu - Pagina de pornire


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming MX Goemans, DP Williamson Journal of the ACM (JACM) 42 (6), 1115-1145, 1995	5327*	1995
A general approximation technique for constrained forest problems MX Goemans, DP Williamson SIAM Journal on Computing 24 (2), 296-317, 1995	1173	1995
Approximating the value of two power proof systems, with applications to max 2sat and max dicut U Feige, M Goemans Proceedings third Israel symposium on the theory of computing and systems …, 1995	468	1995
The primal-dual method for approximation algorithms and its application to network design problems MX Goemans, DP Williamson Approximation algorithms for NP-hard problems, 144-191, 1997	450	1997
Approximating the stochastic knapsack problem: The benefit of adaptivity BC Dean, MX Goemans, J Vondrák Mathematics of Operations Research 33 (4), 945-964, 2008	435	2008
New 34-approximation algorithms for the maximum satisfiability problem MX Goemans, DP Williamson SIAM Journal on Discrete Mathematics 7 (4), 656-666, 1994	404	1994
Semidefinite programming in combinatorial optimization MX Goemans Mathematical Programming 79 (1), 143-161, 1997	384	1997
A note on the prize collecting traveling salesman problem D Bienstock, MX Goemans, D Simchi-Levi, D Williamson Mathematical programming 59 (1), 413-420, 1993	372	1993
Tight approximation algorithms for maximum general assignment problems L Fleischer, MX Goemans, VS Mirrokni, M Sviridenko SODA 6, 611-620, 2006	358	2006
Improved approximation algorithms for network design problems MX Goemans, AV Goldberg, S Plotkin, DB Shmoys, E Tardos, ... Cornell University Operations Research and Industrial Engineering, 1995	326	1995
Cooperative facility location games MX Goemans, M Skutella Journal of Algorithms 50 (2), 194-214, 2004	269	2004
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	266	2017
An improved approximation ratio for the minimum latency problem M Goemans, J Kleinberg Mathematical Programming 82 (1), 111-124, 1998	266	1998
Sink equilibria and convergence M Goemans, V Mirrokni, A Vetta 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 142-151, 2005	265	2005
A primal-dual approximation algorithm for generalized Steiner network problems DP Williamson, MX Goemans, M Mihail, VV Vazirani Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993	263	1993
Survivable networks, linear programming relaxations and the parsimonious property MX Goemans, DJ Bertsimas Mathematical programming 60 (1), 145-166, 1993	262	1993
A catalog of Steiner tree formulations MX Goemans, YS Myung Networks 23 (1), 19-28, 1993	245	1993
On the single-source unsplittable flow problem Y Dinitz, N Garg, MX Goemans Combinatorica 19 (1), 17-41, 1999	239	1999
Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization M Jünger, V Kaibel Springer-Verlag, 2005	235	2005
Minimum bounded degree spanning trees MX Goemans 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006	218	2006

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori