Michel X. Goemans
45th Annual IEEE Symposium on Foundations of Computer Science · 1995–2006
A researcher in the Science corpus: 4 papers; trusts 1 researcher and is trusted by 100 researchers here, as inferred from the citation graph.
Whom Michel X. Goemans trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Michel X. Goemans overall
- Anshumali Shrivastava
- Ping Li
- Jaehyun Park
- Uriel Feige
- Pablo A. Parrilo
- S. Burer
- Avrim Blum
- Sébastien Bubeck
- Prasad Raghavendra
- Gilles Pisier
Papers from Michel X. Goemans's perspective
Ordered by how strongly the researchers Michel X. Goemans trusts endorse each paper. Same corpus, a different order for every researcher.
- Combinatorial optimization. Polyhedra and efficiency.
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
- Reducibility Among Combinatorial Problems
- Faster and simpler algorithms for multicommodity flow and other fractional packing problems
- Fast approximation algorithms for fractional packing and covering problems
- TSPLIB - A Traveling Salesman Problem Library
- Proof verification and hardness of approximation problems
- I and J
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (Operational Research)
- Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
Their papers
- Tight approximation algorithms for maximum general assignment problems (2006) — 307 citations
- Single Machine Scheduling with Release Dates (2002) — 160 citations
- Approximating the stochastic knapsack problem: the benefit of adaptivity (2004) — 400 citations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (1995)