The following pages link to Michel X. Goemans (Q687041):
Displaying 42 items.
- On the Maximum Number of Triangles in Wheel-Free Graphs (Q4306433) (← links)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem (Q4317711) (← links)
- (Q4347896) (← links)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming (Q4369893) (← links)
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover (Q4388988) (← links)
- (Q4398367) (← links)
- (Q4449247) (← links)
- Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler (Q4490785) (← links)
- (Q4517107) (← links)
- (Q4633864) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
- A supermodular relaxation for scheduling with release dates (Q4645930) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- Trade-offs on the location of the core node in a network (Q4651926) (← links)
- (Q4763416) (← links)
- (Q4780776) (← links)
- Cooperative facility location games (Q4820880) (← links)
- A General Approximation Technique for Constrained Forest Problems (Q4834382) (← links)
- (Q4875179) (← links)
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances (Q4888174) (← links)
- Cooperative facility location games (Q4952603) (← links)
- Approximating Incremental Combinatorial Optimization Problems (Q5002607) (← links)
- Polynomiality for Bin Packing with a Constant Number of Item Types (Q5056451) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q5176000) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q5248542) (← links)
- A catalog of steiner tree formulations (Q5285475) (← links)
- A Lower Bound on the Expected Cost of an Optimal Assignment (Q5287981) (← links)
- Matroids Are Immune to Braess’ Paradox (Q5359118) (← links)
- An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem (Q5360842) (← links)
- Polynomiality for Bin Packing with a Constant Number of Item Types (Q5384022) (← links)
- Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs (Q5384086) (← links)
- On the Integrality Ratio for the Asymmetric Traveling Salesman Problem (Q5387977) (← links)
- Matroids and integrality gaps for hypergraphic steiner tree relaxations (Q5415542) (← links)
- (Q5417632) (← links)
- Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data (Q5449534) (← links)
- (Q5501314) (← links)
- (Q5501356) (← links)
- (Q5501838) (← links)
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? (Q5704055) (← links)
- Semidefinite programming and combinatorial optimization (Q5904070) (← links)
- Number of faults a system can withstand without repairs (Q6502415) (← links)
- Shrunk subspaces via operator Sinkhorn iteration (Q6538595) (← links)
