The following pages link to Michel X. Goemans (Q687041):
Displaying 50 items.
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A flow model based on polylinking system (Q715085) (← links)
- Smallest compact formulation for the permutahedron (Q745678) (← links)
- On the single-source unsplittable flow problem (Q1125608) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q1307344) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Arborescence polytopes for series-parallel graphs (Q1329787) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Wide partitions, Latin tableaux, and Rota's basis conjecture (Q1415381) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- (Q1785370) (redirect page) (← links)
- Congestion games viewed from M-convexity (Q1785371) (← links)
- A generalization of Petersen's theorem (Q1801707) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- Worst-case comparison of valid inequalities for the TSP (Q1908019) (← links)
- Semidefinite programs and association schemes (Q1969297) (← links)
- Discrete Newton's algorithm for parametric submodular function minimization (Q2401158) (← links)
- 2-change for k-connected networks (Q2638954) (← links)
- Approximate Edge Splitting (Q2706195) (← links)
- Single Machine Scheduling with Release Dates (Q2784510) (← links)
- .879-approximation algorithms for MAX CUT and MAX 2SAT (Q2817633) (← links)
- Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations (Q2848561) (← links)
- Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281) (← links)
- (Q2921694) (← links)
- (Q2921713) (← links)
- Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
- (Q3099402) (← links)
- (Q3128880) (← links)
- (Q3128895) (← links)
- (Q3138916) (← links)
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity (Q3169009) (← links)
- Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem (Q3360680) (← links)
- Covering minimum spanning trees of random subgraphs (Q3419593) (← links)
- Improved Bounds on Nonblocking 3-Stage Clos Networks (Q3507524) (← links)
- Stochastic Covering and Adaptivity (Q3525789) (← links)
- An approximate König's theorem for edge-coloring weighted bipartite graphs (Q3581002) (← links)
- Tight approximation algorithms for maximum general assignment problems (Q3581502) (← links)
- Deformable Polygon Representation and Near-Mincuts (Q3601918) (← links)
- (Q4234132) (← links)
- (Q4234151) (← links)
- (Q4252309) (← links)
