Michel Goemans | Academic Influence

Michel Goemans's AcademicInfluence.com Rankings

Michel Goemans

Mathematics

#1246

World Rank

#2086

Historical Rank

Operations Research

#13

World Rank

#13

Historical Rank

Measure Theory

#1672

World Rank

#2058

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Michel Goemans Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Michel Xavier Goemans is a Belgian-American professor of applied mathematics and the RSA Professor of Mathematics at MIT working in discrete mathematics and combinatorial optimization at CSAIL and MIT Operations Research Center.

(See a Problem?)

Michel Goemans's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (1995) (3632)
A general approximation technique for constrained forest problems (1992) (890)
Semidefinite programming in combinatorial optimization (1997) (381)
Approximating the stochastic knapsack problem: the benefit of adaptivity (2004) (364)
.879-approximation algorithms for MAX CUT and MAX 2SAT (1994) (358)
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT (1995) (356)
The primal-dual method for approximation algorithms and its application to network design problems (1996) (331)
Tight approximation algorithms for maximum general assignment problems (2006) (279)
A note on the prize collecting traveling salesman problem (1993) (267)
New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem (1994) (248)
Improved approximation algorithms for network design problems (1994) (245)
Sink equilibria and convergence (2005) (238)
A primal-dual approximation algorithm for generalized steiner network problems (1993) (209)
An improved approximation ratio for the minimum latency problem (1996) (203)
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem (2010) (195)
Cooperative facility location games (2000) (193)
Survivable networks, linear programming relaxations and the parsimonious property (1993) (190)
Market sharing games applied to content distribution in ad hoc networks (2004) (184)
A catalog of steiner tree formulations (1993) (179)
Approximating submodular functions everywhere (2009) (164)
Minimum Bounded Degree Spanning Trees (2006) (162)
Single Machine Scheduling with Release Dates (2002) (157)
Worst-case comparison of valid inequalities for the TSP (1995) (155)
On the Single-Source Unsplittable Flow Problem (1998) (155)
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (2001) (150)
Adaptivity and approximation for stochastic packing problems (2005) (127)
Improved approximation algorthims for scheduling with release dates (1997) (122)
Smallest compact formulation for the permutahedron (2015) (117)
The Constrained Minimum Spanning Tree Problem (Extended Abstract) (1996) (117)
The Steiner tree polytope and related polyhedra (1994) (107)
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (1998) (103)
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003) (96)
The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover (1998) (87)
An efficient approximation algorithm for the survivable network design problem (1998) (84)
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? (2000) (77)
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs (1998) (74)
Polynomiality for Bin Packing with a Constant Number of Item Types (2013) (73)
Minimizing submodular functions over families of sets (1995) (73)
Approximating the smallest k‐edge connected spanning subgraph by LP‐rounding (2005) (52)
An algorithmic framework for wireless information flow (2009) (51)
Stochastic Covering and Adaptivity (2006) (51)
A Supermodular Relaxation for Scheduling with Release Dates (1996) (48)
Semidefinite programming and combinatorial optimization (1998) (47)
Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares (2017) (46)
An Approximation Algorithm for Scheduling on Three Dedicated Machines (1995) (39)
Improved Bounds for On-Line Load Balancing (1996) (39)
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem (2006) (39)
Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach (2018) (39)
Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem (1991) (37)
Two-dimensional Gantt charts and a scheduling algorithm of Lawler (2000) (34)
The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown (1996) (31)
A Lower Bound on the Expected Cost of an Optimal Assignment (1993) (31)
Approximating minimum-cost graph problems with spanning tree edges (1994) (29)
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (1989) (28)
Deformable Polygon Representation and Near-Mincuts (2008) (27)
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem (2000) (26)
On the parsimonious property of connectivity problems (1990) (24)
The Unsplittable Stable Marriage Problem (2006) (24)
Combining Approximation Algorithms for the Prize-Collecting TSP (2009) (23)
Tight Approximation Algorithms for Maximum Separable Assignment Problems (2019) (23)
Matroids Are Immune to Braess' Paradox (2015) (22)
From graphs to matrices, and back: new techniques for graph algorithms (2011) (22)
Semidefinite programming in combinatorial optimization 1 (1997) (21)
Computational experience with an approximation algorithm on large-scale Euclidean matching instances (1994) (20)
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs (2014) (19)
Approximating the smallest k-edge connected spanning subgraph by LP-rounding (2009) (18)
Universal bounds on buffer size for packetizing fluid policies in input queued, crossbar switches (2004) (17)
Chernoff bounds , and some applications (2014) (17)
Primal-Dual Approximation Algorithms for Feedback Problems (1996) (16)
Cut structures and randomized algorithms in edge-connectivity problems (1997) (16)
Scheduling Algorithms for Providing Flexible , Rate-Based , Quality of Service Guarantees for Packet-Switching in Banyan Networks (2004) (15)
On the integrality ratio for asymmetric TSP (2004) (15)
Bounded-degree minimum spanning trees (2006) (14)
Improved Bounds on Nonblocking 3-Stage Clos Networks (2007) (14)
New 3⁄4 - Approximation Algorithms for MAX SAT (2001) (14)
Lecture notes on bipartite matching (13)
Approximation algorithms for distributed and selfish agents (2005) (13)
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem (2009) (11)
Discrete Newton's Algorithm for Parametric Submodular Function Minimization (2017) (11)
A new \frac34-approximation algorithm for MAX SAT (1993) (11)
Minimum Cuts (2010) (11)
Semidefinite Programs and Association Schemes (1999) (11)
Wide partitions, Latin tableaux, and Rota's basis conjecture (2002) (10)
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling (2003) (9)
Symmetric Submodular Function Minimization Under Hereditary Family Constraints (2010) (9)
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data (2006) (9)
A flow model based on polylinking system (2012) (8)
Linear Programming and Polyhedral Combinatorics (2009) (8)
Congestion games viewed from M-convexity (2015) (8)
Polyhedral Description of Trees and Arborescences (1992) (7)
Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases (2016) (7)
On the Maximum Number of Triangles in Wheel-Free Graphs (1994) (6)
Network Ows (2007) (6)
An approximate König's theorem for edge-coloring weighted bipartite graphs (2004) (6)
Analysis of Linear Programming Relaxations for a Class of Connectivity Problems (1990) (6)
Lecture 13 (2018) (6)
Advanced Algorithms (1994) (5)
Doubly-Efficient Pseudo-Deterministic Proofs (2019) (5)
Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations (2013) (5)
Contributions on secretary problems, independent sets of rectangles and related problems (2011) (5)
Trade‐offs on the location of the core node in a network (2004) (4)
Scheduling techniques for packet routing, load balancing and disk scheduling (1997) (4)
Lecture Notes on the Ellipsoid Algorithm (4)
2-Change for k-connected networks (1991) (4)
Approximating Incremental Combinatorial Optimization Problems (2017) (3)
Public Key Cryptosystems (2021) (3)
On Learning Submodular Functions A Preliminary Draft (2007) (3)
Approximation Algorithm for MAX-CUT (2007) (3)
Approximating fluid schedules in packet-switched networks (2004) (2)
Approximate Edge Splitting (2001) (2)
Lecture 12 (2018) (2)
w(E) ≥ (2008) (2)
Integer Programming and Combinatorial Optimization (2014) (1)
Approximation algorithms for packing and scheduling problems (2004) (1)
Graphic Matroids (2004) (1)
Lecture 16: Approximation Algorithms (2008) (1)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009) (1)
Number of faults a system can withstand without repairs (1994) (1)
Approximation Taxonomy of Metric TSP (2013) (1)
Approximating Fluid Schedules in Crossbar Packet-Switches and Banyan Networks (2006) (1)
THE MATHEMATICAL WORK OF DANIEL SPIELMAN (2011) (1)
Batcher's Algorithm (1)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009) (1)
Linear Programming (2021) (1)
Semidefinite Programming and Combinatorial Optimization Documenta M a Thematica Extra Volume Icm 1998 Iii 657{666 (1998) (1)
C C ] 2 O ct 2 01 9 Doubly-Efficient Pseudo-Deterministic Proofs (2019) (0)
Arora's (1 + E)-ApproximationScheme for the (1996) (0)
The Lovasz Splitting-off Lemma (2004) (0)
0 a Generic R-approximation Algorithm (0)
Building Optimal Score Computation (1998) (0)
Scribe : Ben Recht 1 Special cases of submodular flows (0)
Shrunk subspaces via operator Sinkhorn iteration (2022) (0)
7. Lecture Notes on the Ellipsoid Algorithm (2009) (0)
Lempel-Ziv codes (2015) (0)
Lectures 9 and 10 (2014) (0)
A Note on Embedding Complete Graphs intoHypercubesMichel Goemans (2010) (0)
5. Lecture Notes on Matroid Intersection (2011) (0)
8.438 Advanced Combinatorial Optimization 2 Iwata and Orlin's Algorithm (2012) (0)
8.438 Advanced Combinatorial Optimization (2009) (0)
Solutions to Problem Set 1 2017 Spring (0)
4 Fibonacci heaps (2008) (0)
Advanced Algorithms (PDF) (2009) (0)
Definition 1. Let X and Y be metric spaces. Let f: X → Y. If (2006) (0)
Euclidean Tsp (part I) (1996) (0)
On-line algorithms: (2019) (0)
CS 473 : Fundamental Algorithms , Spring 2011 Introduction to Randomized Algorithms : Quick Sort and Quick Selection Lecture (2011) (0)
Session details: Session 12A (2007) (0)
Goemans Linear Programming and Polyhedral Combinatorics (0)
Using Complex Semidefinite Programming for Approximating MAX E2-LIN3 (2001) (0)
Goemans Lecture notes on the mincut problem 1 Minimum Cuts (2007) (0)
VLSI Design, Parallel Computation and Distributed Computing (1991) (0)
Advanced Algorithms 28 November 2001 (2007) (0)
Probabilistic Analysis of the 1-tree Relaxation for the Eculidean Traveling Salesman Problem (2015) (0)
Probability Theory Sample Spaces and Events (0)
Retirement funding : how to build real wealth : practice management : health and finance (2006) (0)
A1.47-approximationalgorithmforapreemptivesingle-machine schedulingproblem (2000) (0)
Session details: Session 7B (2003) (0)
Shannon ’ s Noisy Coding Theorem (2010) (0)
Low Degree Spanning Trees Of Small Weight (1996) (0)
2 Approximating Incremental Combinatorial Optimization Problems (2017) (0)
Smallest compact formulation for the permutahedron (2014) (0)
Lecture notes on matroid optimization 4 . 1 Definition of a Matroid (2009) (0)
Session details: Session 3B (2007) (0)
Session details: Session 6B (2003) (0)
Modular Arithmetic and Elementary Algebra (2015) (0)
Matroid optimization 5 . 1 Definition of a Matroid (2016) (0)
Pigeonhole Principle and the Probabilistic Method (0)
Linear Programming 1.1 Formulations 1.1.1 the Diet Problem (2014) (0)
Network Ows Single Source Shortest Path Problem (2004) (0)
Approximation Taxonomy of Metric TSP ( Update : April 2015 ) (2015) (0)
Aprimal{dualinterpretationoftwo2-approximationalgorithms forthefeedbackvertexsetprobleminundirectedgraphs (1998) (0)
Deterministic network information flows using polylinking systems (2010) (0)
AN AVERAGE MAXIMUM DISTANCE (1990) (0)
Lectures 4 and 6 (2014) (0)
Lecture notes on matroid intersection (2009) (0)
Matching Polytope and Totally Dual Integrality (2020) (0)
Notes on Primal-Dual Method For Approximation and Network Design (2017) (0)
18.409: Topics in TCS: Embeddings of Finite Metric Spaces (2006) (0)
Guest editor’s foreword (2006) (0)
Advanced Combinatorial Optimization Feb 2020 Algebraic Approach to Matchings (2020) (0)
A Catalog of Steinger Tress Formulations (1991) (0)
ffl)-Approximation Scheme for the Euclidean TSP (1996) (0)
Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization (2013) (0)
Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization (2001) (0)
Integer programming and combinatorial optimization : 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013, proceedings (2013) (0)
A generalization of Petersen's theorem (1993) (0)
The Generalized Steiner tree problem Problem 1 ( Generalized Steiner tree problem ) (2009) (0)
Lectures on Nonbipartite Matchings (2020) (0)
Lecture 4 (2009) (0)
Combinatorics, Geometry and Probability: On the Maximum Number of Triangles in Wheel-Free Graphs (1997) (0)
6.854J / 18.415J Advanced Algorithms, Fall 2001 (2001) (0)
6.1 Maximum Flows (2009) (0)
8.997 Topics in Combinatorial Optimization 18 Orientations, Directed Cuts and Submodular Flows 18.1 Graph Orientations (2004) (0)
A flow model based on polylinking system (2011) (0)
Wide Partitions , Latin Tableaux , and Rota ' s Basis Conje tureTimothy (2002) (0)
Shannon ’ s noiseless coding theorem (2013) (0)
Implementation of Cancel with dynamic trees (2008) (0)
Linear Error-Correcting Codes (2014) (0)

This paper list is powered by the following services:

Other Resources About Michel Goemans

en.wikipedia.org

What Schools Are Affiliated With Michel Goemans?

Michel Goemans is affiliated with the following schools:

Massachusetts Institute of Technology

Image Attributions

Image Source for Michel Goemans