default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel X. Goemans
Person information
- affiliation: MIT, Cambridge, USA
- award (2000): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c47]Cole Franks, Tasuku Soma
, Michel X. Goemans:
Shrunk subspaces via operator Sinkhorn iteration. SODA 2023: 1655-1668- 2022
- [i13]Cole Franks, Tasuku Soma, Michel X. Goemans:
Shrunk subspaces via operator Sinkhorn iteration. CoRR abs/2207.08311 (2022) - 2020
- [j52]Michel X. Goemans, Thomas Rothvoss:
Polynomiality for Bin Packing with a Constant Number of Item Types. J. ACM 67(6): 38:1-38:21 (2020)
2010 – 2019
- 2019
- [i12]Michel X. Goemans, Shafi Goldwasser, Dhiraj Holden:
Doubly-Efficient Pseudo-Deterministic Proofs. CoRR abs/1910.00994 (2019) - [i11]Michel X. Goemans, Shafi Goldwasser, Dhiraj Holden:
Doubly-Efficient Pseudo-Deterministic Proofs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i10]Chiheon Kim, Afonso S. Bandeira, Michel X. Goemans:
Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach. CoRR abs/1807.02884 (2018) - 2017
- [j51]Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem. Oper. Res. 65(4): 1043-1061 (2017) - [j50]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids Are Immune to Braess' Paradox. Math. Oper. Res. 42(3): 745-761 (2017) - [c46]Michel X. Goemans, Francisco Unda:
Approximating Incremental Combinatorial Optimization Problems. APPROX-RANDOM 2017: 6:1-6:14 - [c45]Michel X. Goemans, Swati Gupta, Patrick Jaillet:
Discrete Newton's Algorithm for Parametric Submodular Function Minimization. IPCO 2017: 212-227 - [i9]Chiheon Kim, Afonso S. Bandeira, Michel X. Goemans:
Community Detection in Hypergraphs, Spiked Tensor Models, and Sum-of-Squares. CoRR abs/1705.02973 (2017) - 2016
- [i8]Swati Gupta, Michel X. Goemans, Patrick Jaillet:
Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases. CoRR abs/1603.00522 (2016) - 2015
- [j49]Michel X. Goemans:
Smallest compact formulation for the permutahedron. Math. Program. 153(1): 5-11 (2015) - [j48]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3): 329-333 (2015) - [i7]Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids are Immune to Braess Paradox. CoRR abs/1504.07545 (2015) - 2014
- [c44]Michel X. Goemans, Thomas Rothvoß:
Polynomiality for Bin Packing with a Constant Number of Item Types. SODA 2014: 830-839 - [c43]Wang Chi Cheung, Michel X. Goemans, Sam Chiu-wai Wong:
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs. SODA 2014: 1714-1726 - 2013
- [j47]Michel X. Goemans, José A. Soto:
Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations. SIAM J. Discret. Math. 27(2): 1123-1145 (2013) - [e3]Michel X. Goemans, José Correa:
Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings. Lecture Notes in Computer Science 7801, Springer 2013, ISBN 978-3-642-36693-2 [contents] - [i6]Michel X. Goemans, Thomas Rothvoß:
Polynomiality for Bin Packing with a Constant Number of Item Types. CoRR abs/1307.5108 (2013) - 2012
- [j46]Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
A flow model based on polylinking system. Math. Program. 135(1-2): 1-23 (2012) - [c42]Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen:
Matroids and integrality gaps for hypergraphic steiner tree relaxations. STOC 2012: 1161-1176 - 2011
- [j45]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight Approximation Algorithms for Maximum Separable Assignment Problems. Math. Oper. Res. 36(3): 416-431 (2011) - [i5]Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen:
Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. CoRR abs/1111.7280 (2011) - 2010
- [c41]Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi:
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. SODA 2010: 379-389 - [i4]Michel X. Goemans, José A. Soto:
Symmetric Submodular Function Minimization Under Hereditary Family Constraints. CoRR abs/1007.2140 (2010)
2000 – 2009
- 2009
- [j44]Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53(4): 345-357 (2009) - [c40]Michel X. Goemans, Satoru Iwata, Rico Zenklusen:
An algorithmic framework for wireless information flow. Allerton 2009: 294-300 - [c39]Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni:
Approximating submodular functions everywhere. SODA 2009: 535-544 - [i3]Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh:
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/0909.0941 (2009) - [i2]Michel X. Goemans:
Combining Approximation Algorithms for the Prize-Collecting TSP. CoRR abs/0910.0553 (2009) - 2008
- [j43]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33(4): 945-964 (2008) - 2007
- [j42]José R. Correa, Michel X. Goemans:
Improved Bounds on Nonblocking 3-Stage Clos Networks. SIAM J. Comput. 37(3): 870-894 (2007) - 2006
- [j41]Michel X. Goemans, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan:
Market sharing games applied to content distribution in ad hoc networks. IEEE J. Sel. Areas Commun. 24(5): 1020-1033 (2006) - [j40]Moses Charikar, Michel X. Goemans, Howard J. Karloff:
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 31(2): 245-252 (2006) - [j39]Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006) - [j38]Michael Rosenblum, Constantine Caramanis, Michel X. Goemans, Vahid Tarokh:
Approximating fluid schedules in crossbar packet-switches and Banyan networks. IEEE/ACM Trans. Netw. 14(6): 1374-1387 (2006) - [c38]Brian C. Dean, Michel X. Goemans, Nicole Immorlica:
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. ESA 2006: 268-279 - [c37]Michel X. Goemans:
Minimum Bounded Degree Spanning Trees. FOCS 2006: 273-282 - [c36]Brian C. Dean, Michel X. Goemans, Nicole Immorlica:
The Unsplittable Stable Marriage Problem. IFIP TCS 2006: 65-75 - [c35]Michel X. Goemans, Jan Vondrák:
Stochastic Covering and Adaptivity. LATIN 2006: 532-543 - [c34]Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko:
Tight approximation algorithms for maximum general assignment problems. SODA 2006: 611-620 - 2005
- [c33]Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta:
Sink Equilibria and Convergence. FOCS 2005: 142-154 - [c32]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404 - [c31]Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson:
Approximating the smallest k-edge connected spanning subgraph by LP-rounding. SODA 2005: 562-571 - 2004
- [j37]Michel X. Goemans, Martin Skutella:
Cooperative facility location games. J. Algorithms 50(2): 194-214 (2004) - [j36]Michel X. Goemans, David P. Williamson:
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. J. Comput. Syst. Sci. 68(2): 442-470 (2004) - [j35]Jean-François Macq, Michel X. Goemans:
Trade-offs on the location of the core node in a network. Networks 44(3): 179-186 (2004) - [c30]Moses Charikar, Michel X. Goemans, Howard J. Karloff:
On the Integrality Ratio for Asymmetric TSP. FOCS 2004: 101-107 - [c29]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217 - [c28]Michael Rosenblum, Michel X. Goemans, Vahid Tarokh:
Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input Queued, Crossbar Switches. INFOCOM 2004: 1126-1134 - [c27]Michel X. Goemans, Li (Erran) Li, Vahab S. Mirrokni, Marina Thottan:
Market sharing games applied to content distribution in ad-hoc networks. MobiHoc 2004: 55-66 - [c26]Jean-François Macq, Michel X. Goemans:
Trade-offs on the location of the core node in a network. SODA 2004: 597-604 - [c25]Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. SODA 2004: 934-941 - [c24]José R. Correa, Michel X. Goemans:
An approximate König's theorem for edge-coloring weighted bipartite graphs. STOC 2004: 398-406 - 2003
- [j34]Timothy Y. Chow, C. Kenneth Fan, Michel X. Goemans, Jan Vondrák:
Wide partitions, Latin tableaux, and Rota's basis conjecture. Adv. Appl. Math. 31(2): 334-358 (2003) - [c23]Brian C. Dean, Michel X. Goemans:
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. ICALP 2003: 1138-1152 - [e2]Lawrence L. Larmore, Michel X. Goemans:
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. ACM 2003, ISBN 1-58113-674-9 [contents] - 2002
- [j33]Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang:
Single Machine Scheduling with Release Dates. SIAM J. Discret. Math. 15(2): 165-192 (2002) - 2001
- [j32]Michel X. Goemans, Levent Tunçel:
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? Math. Oper. Res. 26(4): 796-815 (2001) - [j31]Michel X. Goemans:
Approximate Edge Splitting. SIAM J. Discret. Math. 14(1): 138-141 (2001) - [c22]Michel X. Goemans:
Using Complex Semidefinite Programming for Approximating MAX E2-LIN3. RANDOM-APPROX 2001: 1 - [c21]Michel X. Goemans, David P. Williamson:
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. STOC 2001: 443-452 - [e1]Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan:
Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings. Lecture Notes in Computer Science 2129, Springer 2001, ISBN 3-540-42470-9 [contents] - 2000
- [j30]Michel X. Goemans, Joel Wein, David P. Williamson:
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Oper. Res. Lett. 26(4): 149-154 (2000) - [j29]Michel X. Goemans, David P. Williamson:
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. SIAM J. Discret. Math. 13(3): 281-294 (2000) - [c20]Michel X. Goemans, Martin Skutella:
Cooperative facility location games. SODA 2000: 76-85
1990 – 1999
- 1999
- [j28]Matthew Andrews, Michel X. Goemans, Lisa Zhang:
Improved Bounds for On-Line Load Balancing. Algorithmica 23(4): 278-301 (1999) - [j27]Yefim Dinitz, Naveen Garg, Michel X. Goemans:
On the Single-Source Unsplittable Flow Problem. Comb. 19(1): 17-41 (1999) - [j26]Michel X. Goemans, Franz Rendl:
Semidefinite Programs and Association Schemes. Computing 63(4): 331-340 (1999) - [c19]Michel X. Goemans, David P. Williamson:
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. SODA 1999: 366-375 - 1998
- [j25]Michel X. Goemans, David P. Williamson:
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. Comb. 18(1): 37-59 (1998) - [j24]Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. Math. Program. 82: 13-40 (1998) - [j23]Michel X. Goemans, Jon M. Kleinberg:
An improved approximation ratio for the minimum latency problem. Math. Program. 82: 111-124 (1998) - [j22]Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson:
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper. Res. Lett. 22(4-5): 111-118 (1998) - [j21]Jon M. Kleinberg, Michel X. Goemans:
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. SIAM J. Discret. Math. 11(2): 196-204 (1998) - [c18]Yefim Dinitz, Naveen Garg, Michel X. Goemans:
On the Single-Source Unsplittable Flow Problem. FOCS 1998: 290-299 - 1997
- [j20]Michel X. Goemans:
Semidefinite programming in combinatorial optimization. Math. Program. 79: 143-161 (1997) - [c17]Michel X. Goemans:
Improved Approximation Algorithms for Scheduling with Release Dates. SODA 1997: 591-598 - 1996
- [j19]David P. Williamson, Michel X. Goemans:
Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. INFORMS J. Comput. 8(1): 29-40 (1996) - [c16]Matthew Andrews, Michel X. Goemans, Lisa Zhang:
Improved Bounds for On-line Load Balancing. COCOON 1996: 1-10 - [c15]Michel X. Goemans, David P. Williamson:
Primal-Dual Approximation Algorithms for Feedback Problems. IPCO 1996: 147-161 - [c14]Michel X. Goemans:
A Supermodular Relaxation for Scheduling with Release Dates. IPCO 1996: 288-300 - [c13]Michel X. Goemans, Leslie A. Hall:
The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. IPCO 1996: 415-429 - [c12]Michel X. Goemans, Jon M. Kleinberg:
An Improved Approximation Ratio for the Minimum Latency Problem. SODA 1996: 152-158 - [c11]R. Ravi, Michel X. Goemans:
The Constrained Minimum Spanning Tree Problem (Extended Abstract). SWAT 1996: 66-75 - 1995
- [j18]David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Comb. 15(3): 435-454 (1995) - [j17]Michel X. Goemans, V. S. Ramakrishnan:
Minimizing Submodular Functions over Families of Sets. Comb. 15(4): 499-513 (1995) - [j16]Michel X. Goemans:
An Approximation Algorithm for Scheduling on Three Dedicated Machines. Discret. Appl. Math. 61(1): 49-59 (1995) - [j15]Michel X. Goemans, David P. Williamson:
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. ACM 42(6): 1115-1145 (1995) - [j14]Michel X. Goemans:
Worst-case comparison of valid inequalities for the TSP. Math. Program. 69: 335-349 (1995) - [j13]Michel X. Goemans, David P. Williamson:
A General Approximation Technique for Constrained Forest Problems. SIAM J. Comput. 24(2): 296-317 (1995) - [c10]Uriel Feige, Michel X. Goemans:
Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. ISTCS 1995: 182-189 - 1994
- [j12]Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman:
On the Maximum Number of Triangles in Wheel-Free Graphs. Comb. Probab. Comput. 3: 63-75 (1994) - [j11]Michel X. Goemans:
Arborescence Polytopes for Series-parallel Graphs. Discret. Appl. Math. 51(3): 277-289 (1994) - [j10]Michel X. Goemans:
The Steiner tree polytope and related polyhedra. Math. Program. 63: 157-182 (1994) - [j9]Michel X. Goemans, David P. Williamson:
Approximating minimum-cost graph problems with spanning tree edges. Oper. Res. Lett. 16(4): 183-189 (1994) - [j8]Michel X. Goemans, David P. Williamson:
New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem. SIAM J. Discret. Math. 7(4): 656-666 (1994) - [c9]Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson:
Improved Approximation Algorithms for Network Design Problems. SODA 1994: 223-232 - [c8]David P. Williamson, Michel X. Goemans:
Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. SODA 1994: 355-364 - [c7]Michel X. Goemans, David P. Williamson:
.879-approximation algorithms for MAX CUT and MAX 2SAT. STOC 1994: 422-431 - [i1]Michel X. Goemans, Nancy A. Lynch, Isaac Saias:
Number of faults a system can withstand without repairs. CoRR abs/math/9409220 (1994) - 1993
- [j7]Michel X. Goemans:
A generalization of Petersen's theorem. Discret. Math. 115(1-3): 277-282 (1993) - [j6]Michel X. Goemans, Muralidharan S. Kodialam:
A Lower Bound on the Expected Cost of an Optimal Assignment. Math. Oper. Res. 18(2): 267-274 (1993) - [j5]Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson:
A note on the prize collecting traveling salesman problem. Math. Program. 59: 413-420 (1993) - [j4]Michel X. Goemans, Dimitris Bertsimas:
Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60: 145-166 (1993) - [j3]Michel X. Goemans, Young-Soo Myung:
A catalog of steiner tree formulations. Networks 23(1): 19-28 (1993) - [c6]Harold N. Gabow, Michel X. Goemans, David P. Williamson:
An efficient approximation algorithm for the survivable network design problem. IPCO 1993: 57-74 - [c5]Michel X. Goemans, David P. Williamson:
A new \frac34-approximation algorithm for MAX SAT. IPCO 1993: 313-321 - [c4]David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani:
A primal-dual approximation algorithm for generalized Steiner network problems. STOC 1993: 708-717 - 1992
- [c3]Michel X. Goemans:
Polyhedral Description of Trees and Arborescences. IPCO 1992: 1-14 - [c2]Michel X. Goemans, David P. Williamson:
A General Approximation Technique for Constrained Forest Problems. SODA 1992: 307-316 - 1991
- [j2]Michel X. Goemans, Dimitris J. Bertsimas:
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem. Math. Oper. Res. 16(1): 72-89 (1991) - [j1]Michel X. Goemans, Kalyan T. Talluri:
2-Change for k-connected networks. Oper. Res. Lett. 10(2): 113-117 (1991) - 1990
- [c1]Michel X. Goemans, Dimitris Bertsimas:
On the Parsimonious Property of Connectivity Problems. SODA 1990: 388-396
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
