Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Michel X. Goemans
@inproceedings{DBLP:conf/soda/FranksSG23, author = {Cole Franks and Tasuku Soma and Michel X. Goemans}, title = {Shrunk subspaces via operator Sinkhorn iteration}, booktitle = {{SODA}}, pages = {1655--1668}, publisher = {{SIAM}}, year = {2023} }
@article{DBLP:journals/corr/abs-2207-08311, author = {Cole Franks and Tasuku Soma and Michel X. Goemans}, title = {Shrunk subspaces via operator Sinkhorn iteration}, journal = {CoRR}, volume = {abs/2207.08311}, year = {2022} }
@article{DBLP:journals/jacm/GoemansR20, author = {Michel X. Goemans and Thomas Rothvoss}, title = {Polynomiality for Bin Packing with a Constant Number of Item Types}, journal = {J. {ACM}}, volume = {67}, number = {6}, pages = {38:1--38:21}, year = {2020} }
@article{DBLP:journals/corr/abs-1910-00994, author = {Michel X. Goemans and Shafi Goldwasser and Dhiraj Holden}, title = {Doubly-Efficient Pseudo-Deterministic Proofs}, journal = {CoRR}, volume = {abs/1910.00994}, year = {2019} }
@article{DBLP:journals/eccc/GoemansGH19, author = {Michel X. Goemans and Shafi Goldwasser and Dhiraj Holden}, title = {Doubly-Efficient Pseudo-Deterministic Proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-135}}, year = {2019} }
@article{DBLP:journals/corr/abs-1807-02884, author = {Chiheon Kim and Afonso S. Bandeira and Michel X. Goemans}, title = {Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach}, journal = {CoRR}, volume = {abs/1807.02884}, year = {2018} }
@article{DBLP:journals/ior/AsadpourGMGS17, author = {Arash Asadpour and Michel X. Goemans and Aleksander Madry and Shayan Oveis Gharan and Amin Saberi}, title = {An \emph{O}(log \emph{n}/log log \emph{n})-Approximation Algorithm for the Asymmetric Traveling Salesman Problem}, journal = {Oper. Res.}, volume = {65}, number = {4}, pages = {1043--1061}, year = {2017} }
@article{DBLP:journals/mor/FujishigeGHPZ17, author = {Satoru Fujishige and Michel X. Goemans and Tobias Harks and Britta Peis and Rico Zenklusen}, title = {Matroids Are Immune to Braess' Paradox}, journal = {Math. Oper. Res.}, volume = {42}, number = {3}, pages = {745--761}, year = {2017} }
@inproceedings{DBLP:conf/approx/GoemansU17, author = {Michel X. Goemans and Francisco Unda}, title = {Approximating Incremental Combinatorial Optimization Problems}, booktitle = {{APPROX-RANDOM}}, series = {LIPIcs}, volume = {81}, pages = {6:1--6:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017} }
@inproceedings{DBLP:conf/ipco/GoemansGJ17, author = {Michel X. Goemans and Swati Gupta and Patrick Jaillet}, title = {Discrete Newton's Algorithm for Parametric Submodular Function Minimization}, booktitle = {{IPCO}}, series = {Lecture Notes in Computer Science}, volume = {10328}, pages = {212--227}, publisher = {Springer}, year = {2017} }
@article{DBLP:journals/corr/KimBG17, author = {Chiheon Kim and Afonso S. Bandeira and Michel X. Goemans}, title = {Community Detection in Hypergraphs, Spiked Tensor Models, and Sum-of-Squares}, journal = {CoRR}, volume = {abs/1705.02973}, year = {2017} }
@article{DBLP:journals/corr/GuptaGJ16, author = {Swati Gupta and Michel X. Goemans and Patrick Jaillet}, title = {Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases}, journal = {CoRR}, volume = {abs/1603.00522}, year = {2016} }
@article{DBLP:journals/mp/Goemans15, author = {Michel X. Goemans}, title = {Smallest compact formulation for the permutahedron}, journal = {Math. Program.}, volume = {153}, number = {1}, pages = {5--11}, year = {2015} }
@article{DBLP:journals/orl/FujishigeGHPZ15, author = {Satoru Fujishige and Michel X. Goemans and Tobias Harks and Britta Peis and Rico Zenklusen}, title = {Congestion games viewed from M-convexity}, journal = {Oper. Res. Lett.}, volume = {43}, number = {3}, pages = {329--333}, year = {2015} }
@article{DBLP:journals/corr/FujishigeGHPZ15, author = {Satoru Fujishige and Michel X. Goemans and Tobias Harks and Britta Peis and Rico Zenklusen}, title = {Matroids are Immune to Braess Paradox}, journal = {CoRR}, volume = {abs/1504.07545}, year = {2015} }
@inproceedings{DBLP:conf/soda/GoemansR14, author = {Michel X. Goemans and Thomas Rothvo{\ss}}, title = {Polynomiality for Bin Packing with a Constant Number of Item Types}, booktitle = {{SODA}}, pages = {830--839}, publisher = {{SIAM}}, year = {2014} }
@inproceedings{DBLP:conf/soda/CheungGW14, author = {Wang Chi Cheung and Michel X. Goemans and Sam Chiu{-}wai Wong}, title = {Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs}, booktitle = {{SODA}}, pages = {1714--1726}, publisher = {{SIAM}}, year = {2014} }
@article{DBLP:journals/siamdm/GoemansS13, author = {Michel X. Goemans and Jos{\'{e}} A. Soto}, title = {Algorithms for Symmetric Submodular Function Minimization under Hereditary Constraints and Generalizations}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {2}, pages = {1123--1145}, year = {2013} }
@proceedings{DBLP:conf/ipco/2013, editor = {Michel X. Goemans and Jos{\'{e}} R. Correa}, title = {Integer Programming and Combinatorial Optimization - 16th International Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7801}, publisher = {Springer}, year = {2013} }
@article{DBLP:journals/corr/GoemansR13, author = {Michel X. Goemans and Thomas Rothvo{\ss}}, title = {Polynomiality for Bin Packing with a Constant Number of Item Types}, journal = {CoRR}, volume = {abs/1307.5108}, year = {2013} }
@article{DBLP:journals/mp/GoemansIZ12, author = {Michel X. Goemans and Satoru Iwata and Rico Zenklusen}, title = {A flow model based on polylinking system}, journal = {Math. Program.}, volume = {135}, number = {1-2}, pages = {1--23}, year = {2012} }
@inproceedings{DBLP:conf/stoc/GoemansORZ12, author = {Michel X. Goemans and Neil Olver and Thomas Rothvo{\ss} and Rico Zenklusen}, title = {Matroids and integrality gaps for hypergraphic steiner tree relaxations}, booktitle = {{STOC}}, pages = {1161--1176}, publisher = {{ACM}}, year = {2012} }
@article{DBLP:journals/mor/FleischerGMS11, author = {Lisa Fleischer and Michel X. Goemans and Vahab S. Mirrokni and Maxim Sviridenko}, title = {Tight Approximation Algorithms for Maximum Separable Assignment Problems}, journal = {Math. Oper. Res.}, volume = {36}, number = {3}, pages = {416--431}, year = {2011} }
@article{DBLP:journals/corr/abs-1111-7280, author = {Michel X. Goemans and Neil Olver and Thomas Rothvo{\ss} and Rico Zenklusen}, title = {Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations}, journal = {CoRR}, volume = {abs/1111.7280}, year = {2011} }
@inproceedings{DBLP:conf/soda/AsadpourGMGS10, author = {Arash Asadpour and Michel X. Goemans and Aleksander Madry and Shayan Oveis Gharan and Amin Saberi}, title = {An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem}, booktitle = {{SODA}}, pages = {379--389}, publisher = {{SIAM}}, year = {2010} }
@article{DBLP:journals/corr/abs-1007-2140, author = {Michel X. Goemans and Jos{\'{e}} A. Soto}, title = {Symmetric Submodular Function Minimization Under Hereditary Family Constraints}, journal = {CoRR}, volume = {abs/1007.2140}, year = {2010} }
@article{DBLP:journals/networks/GabowGTW09, author = {Harold N. Gabow and Michel X. Goemans and {\'{E}}va Tardos and David P. Williamson}, title = {Approximating the smallest \emph{k}-edge connected spanning subgraph by LP-rounding}, journal = {Networks}, volume = {53}, number = {4}, pages = {345--357}, year = {2009} }
@inproceedings{DBLP:conf/allerton/GoemansIZ09, author = {Michel X. Goemans and Satoru Iwata and Rico Zenklusen}, title = {An algorithmic framework for wireless information flow}, booktitle = {Allerton}, pages = {294--300}, publisher = {{IEEE}}, year = {2009} }
@inproceedings{DBLP:conf/soda/GoemansHIM09, author = {Michel X. Goemans and Nicholas J. A. Harvey and Satoru Iwata and Vahab S. Mirrokni}, title = {Approximating submodular functions everywhere}, booktitle = {{SODA}}, pages = {535--544}, publisher = {{SIAM}}, year = {2009} }
@article{DBLP:journals/corr/abs-0909-0941, author = {Michel X. Goemans and Nicholas J. A. Harvey and Kamal Jain and Mohit Singh}, title = {A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem}, journal = {CoRR}, volume = {abs/0909.0941}, year = {2009} }
@article{DBLP:journals/corr/abs-0910-0553, author = {Michel X. Goemans}, title = {Combining Approximation Algorithms for the Prize-Collecting {TSP}}, journal = {CoRR}, volume = {abs/0910.0553}, year = {2009} }
@article{DBLP:journals/mor/DeanGV08, author = {Brian C. Dean and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity}, journal = {Math. Oper. Res.}, volume = {33}, number = {4}, pages = {945--964}, year = {2008} }
@article{DBLP:journals/siamcomp/CorreaG07, author = {Jos{\'{e}} R. Correa and Michel X. Goemans}, title = {Improved Bounds on Nonblocking 3-Stage Clos Networks}, journal = {{SIAM} J. Comput.}, volume = {37}, number = {3}, pages = {870--894}, year = {2007} }
@article{DBLP:journals/jsac/GoemansLMT06, author = {Michel X. Goemans and Li (Erran) Li and Vahab S. Mirrokni and Marina Thottan}, title = {Market sharing games applied to content distribution in ad hoc networks}, journal = {{IEEE} J. Sel. Areas Commun.}, volume = {24}, number = {5}, pages = {1020--1033}, year = {2006} }
@article{DBLP:journals/mor/CharikarGK06, author = {Moses Charikar and Michel X. Goemans and Howard J. Karloff}, title = {On the Integrality Ratio for the Asymmetric Traveling Salesman Problem}, journal = {Math. Oper. Res.}, volume = {31}, number = {2}, pages = {245--252}, year = {2006} }
@article{DBLP:journals/rsa/GoemansV06, author = {Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Covering minimum spanning trees of random subgraphs}, journal = {Random Struct. Algorithms}, volume = {29}, number = {3}, pages = {257--276}, year = {2006} }
@article{DBLP:journals/ton/RosenblumCGT06, author = {Michael Rosenblum and Constantine Caramanis and Michel X. Goemans and Vahid Tarokh}, title = {Approximating fluid schedules in crossbar packet-switches and Banyan networks}, journal = {{IEEE/ACM} Trans. Netw.}, volume = {14}, number = {6}, pages = {1374--1387}, year = {2006} }
@inproceedings{DBLP:conf/esa/DeanGI06, author = {Brian C. Dean and Michel X. Goemans and Nicole Immorlica}, title = {Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data}, booktitle = {{ESA}}, series = {Lecture Notes in Computer Science}, volume = {4168}, pages = {268--279}, publisher = {Springer}, year = {2006} }
@inproceedings{DBLP:conf/focs/Goemans06, author = {Michel X. Goemans}, title = {Minimum Bounded Degree Spanning Trees}, booktitle = {{FOCS}}, pages = {273--282}, publisher = {{IEEE} Computer Society}, year = {2006} }
@inproceedings{DBLP:conf/ifipTCS/DeanGI06, author = {Brian C. Dean and Michel X. Goemans and Nicole Immorlica}, title = {The Unsplittable Stable Marriage Problem}, booktitle = {{IFIP} {TCS}}, series = {{IFIP}}, volume = {209}, pages = {65--75}, publisher = {Springer}, year = {2006} }
@inproceedings{DBLP:conf/latin/GoemansV06, author = {Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Stochastic Covering and Adaptivity}, booktitle = {{LATIN}}, series = {Lecture Notes in Computer Science}, volume = {3887}, pages = {532--543}, publisher = {Springer}, year = {2006} }
@inproceedings{DBLP:conf/soda/FleischerGMS06, author = {Lisa Fleischer and Michel X. Goemans and Vahab S. Mirrokni and Maxim Sviridenko}, title = {Tight approximation algorithms for maximum general assignment problems}, booktitle = {{SODA}}, pages = {611--620}, publisher = {{ACM} Press}, year = {2006} }
@inproceedings{DBLP:conf/focs/GoemansMV05, author = {Michel X. Goemans and Vahab S. Mirrokni and Adrian Vetta}, title = {Sink Equilibria and Convergence}, booktitle = {{FOCS}}, pages = {142--154}, publisher = {{IEEE} Computer Society}, year = {2005} }
@inproceedings{DBLP:conf/soda/DeanGV05, author = {Brian C. Dean and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Adaptivity and approximation for stochastic packing problems}, booktitle = {{SODA}}, pages = {395--404}, publisher = {{SIAM}}, year = {2005} }
@inproceedings{DBLP:conf/soda/GabowGTW05, author = {Harold N. Gabow and Michel X. Goemans and {\'{E}}va Tardos and David P. Williamson}, title = {Approximating the smallest \emph{k}-edge connected spanning subgraph by LP-rounding}, booktitle = {{SODA}}, pages = {562--571}, publisher = {{SIAM}}, year = {2005} }
@article{DBLP:journals/jal/GoemansS04, author = {Michel X. Goemans and Martin Skutella}, title = {Cooperative facility location games}, journal = {J. Algorithms}, volume = {50}, number = {2}, pages = {194--214}, year = {2004} }
@article{DBLP:journals/jcss/GoemansW04, author = {Michel X. Goemans and David P. Williamson}, title = {Approximation algorithms for M\({}_{\mbox{AX}}\)-3-C\({}_{\mbox{UT}}\) and other problems via complex semidefinite programming}, journal = {J. Comput. Syst. Sci.}, volume = {68}, number = {2}, pages = {442--470}, year = {2004} }
@article{DBLP:journals/networks/MacqG04, author = {Jean{-}Fran{\c{c}}ois Macq and Michel X. Goemans}, title = {Trade-offs on the location of the core node in a network}, journal = {Networks}, volume = {44}, number = {3}, pages = {179--186}, year = {2004} }
@inproceedings{DBLP:conf/focs/CharikarGK04, author = {Moses Charikar and Michel X. Goemans and Howard J. Karloff}, title = {On the Integrality Ratio for Asymmetric {TSP}}, booktitle = {{FOCS}}, pages = {101--107}, publisher = {{IEEE} Computer Society}, year = {2004} }
@inproceedings{DBLP:conf/focs/DeanGV04, author = {Brian C. Dean and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity}, booktitle = {{FOCS}}, pages = {208--217}, publisher = {{IEEE} Computer Society}, year = {2004} }
@inproceedings{DBLP:conf/infocom/RosenblumGT04, author = {Michael Rosenblum and Michel X. Goemans and Vahid Tarokh}, title = {Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input Queued, Crossbar Switches}, booktitle = {{INFOCOM}}, pages = {1126--1134}, publisher = {{IEEE}}, year = {2004} }
@inproceedings{DBLP:conf/mobihoc/GoemansLMT04, author = {Michel X. Goemans and Li (Erran) Li and Vahab S. Mirrokni and Marina Thottan}, title = {Market sharing games applied to content distribution in ad-hoc networks}, booktitle = {MobiHoc}, pages = {55--66}, publisher = {{ACM}}, year = {2004} }
@inproceedings{DBLP:conf/soda/MacqG04, author = {Jean{-}Fran{\c{c}}ois Macq and Michel X. Goemans}, title = {Trade-offs on the location of the core node in a network}, booktitle = {{SODA}}, pages = {597--604}, publisher = {{SIAM}}, year = {2004} }
@inproceedings{DBLP:conf/soda/GoemansV04, author = {Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Covering minimum spanning trees of random subgraphs}, booktitle = {{SODA}}, pages = {934--941}, publisher = {{SIAM}}, year = {2004} }
@inproceedings{DBLP:conf/stoc/CorreaG04, author = {Jos{\'{e}} R. Correa and Michel X. Goemans}, title = {An approximate K{\"{o}}nig's theorem for edge-coloring weighted bipartite graphs}, booktitle = {{STOC}}, pages = {398--406}, publisher = {{ACM}}, year = {2004} }
@article{DBLP:journals/aam/ChowFGV03, author = {Timothy Y. Chow and C. Kenneth Fan and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Wide partitions, Latin tableaux, and Rota's basis conjecture}, journal = {Adv. Appl. Math.}, volume = {31}, number = {2}, pages = {334--358}, year = {2003} }
@inproceedings{DBLP:conf/icalp/DeanG03, author = {Brian C. Dean and Michel X. Goemans}, title = {Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling}, booktitle = {{ICALP}}, series = {Lecture Notes in Computer Science}, volume = {2719}, pages = {1138--1152}, publisher = {Springer}, year = {2003} }
@proceedings{DBLP:conf/stoc/2003, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, publisher = {{ACM}}, year = {2003} }
@article{DBLP:journals/siamdm/GoemansQSSW02, author = {Michel X. Goemans and Maurice Queyranne and Andreas S. Schulz and Martin Skutella and Yaoguang Wang}, title = {Single Machine Scheduling with Release Dates}, journal = {{SIAM} J. Discret. Math.}, volume = {15}, number = {2}, pages = {165--192}, year = {2002} }
@article{DBLP:journals/mor/GoemansT01, author = {Michel X. Goemans and Levent Tun{\c{c}}el}, title = {When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?}, journal = {Math. Oper. Res.}, volume = {26}, number = {4}, pages = {796--815}, year = {2001} }
@article{DBLP:journals/siamdm/Goemans01, author = {Michel X. Goemans}, title = {Approximate Edge Splitting}, journal = {{SIAM} J. Discret. Math.}, volume = {14}, number = {1}, pages = {138--141}, year = {2001} }
@inproceedings{DBLP:conf/random/Goemans01, author = {Michel X. Goemans}, title = {Using Complex Semidefinite Programming for Approximating {MAX} {E2-LIN3}}, booktitle = {{RANDOM-APPROX}}, series = {Lecture Notes in Computer Science}, volume = {2129}, pages = {1}, publisher = {Springer}, year = {2001} }
@inproceedings{DBLP:conf/stoc/GoemansW01, author = {Michel X. Goemans and David P. Williamson}, title = {Approximation algorithms for {MAX-3-CUT} and other problems via complex semidefinite programming}, booktitle = {{STOC}}, pages = {443--452}, publisher = {{ACM}}, year = {2001} }
@proceedings{DBLP:conf/random/2001, editor = {Michel X. Goemans and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Luca Trevisan}, title = {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}, series = {Lecture Notes in Computer Science}, volume = {2129}, publisher = {Springer}, year = {2001} }
@article{DBLP:journals/orl/GoemansWW00, author = {Michel X. Goemans and Joel Wein and David P. Williamson}, title = {A 1.47-approximation algorithm for a preemptive single-machine scheduling problem}, journal = {Oper. Res. Lett.}, volume = {26}, number = {4}, pages = {149--154}, year = {2000} }
@article{DBLP:journals/siamdm/GoemansW00, author = {Michel X. Goemans and David P. Williamson}, title = {Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler}, journal = {{SIAM} J. Discret. Math.}, volume = {13}, number = {3}, pages = {281--294}, year = {2000} }
@inproceedings{DBLP:conf/soda/GoemansS00, author = {Michel X. Goemans and Martin Skutella}, title = {Cooperative facility location games}, booktitle = {{SODA}}, pages = {76--85}, publisher = {{ACM/SIAM}}, year = {2000} }
@article{DBLP:journals/algorithmica/AndrewsGZ99, author = {Matthew Andrews and Michel X. Goemans and Lisa Zhang}, title = {Improved Bounds for On-Line Load Balancing}, journal = {Algorithmica}, volume = {23}, number = {4}, pages = {278--301}, year = {1999} }
@article{DBLP:journals/combinatorica/DinitzGG99, author = {Yefim Dinitz and Naveen Garg and Michel X. Goemans}, title = {On the Single-Source Unsplittable Flow Problem}, journal = {Comb.}, volume = {19}, number = {1}, pages = {17--41}, year = {1999} }
@article{DBLP:journals/computing/GoemansR99, author = {Michel X. Goemans and Franz Rendl}, title = {Semidefinite Programs and Association Schemes}, journal = {Computing}, volume = {63}, number = {4}, pages = {331--340}, year = {1999} }
@inproceedings{DBLP:conf/soda/GoemansW99, author = {Michel X. Goemans and David P. Williamson}, title = {Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler}, booktitle = {{SODA}}, pages = {366--375}, publisher = {{ACM/SIAM}}, year = {1999} }
@article{DBLP:journals/combinatorica/GoemansW98, author = {Michel X. Goemans and David P. Williamson}, title = {Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs}, journal = {Comb.}, volume = {18}, number = {1}, pages = {37--59}, year = {1998} }
@article{DBLP:journals/mp/GabowGW98, author = {Harold N. Gabow and Michel X. Goemans and David P. Williamson}, title = {An efficient approximation algorithm for the survivable network design problem}, journal = {Math. Program.}, volume = {82}, pages = {13--40}, year = {1998} }
@article{DBLP:journals/mp/GoemansK98, author = {Michel X. Goemans and Jon M. Kleinberg}, title = {An improved approximation ratio for the minimum latency problem}, journal = {Math. Program.}, volume = {82}, pages = {111--124}, year = {1998} }
@article{DBLP:journals/orl/ChudakGHW98, author = {Fabi{\'{a}}n A. Chudak and Michel X. Goemans and Dorit S. Hochbaum and David P. Williamson}, title = {A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs}, journal = {Oper. Res. Lett.}, volume = {22}, number = {4-5}, pages = {111--118}, year = {1998} }
@article{DBLP:journals/siamdm/KleinbergG98, author = {Jon M. Kleinberg and Michel X. Goemans}, title = {The Lov{\'{a}}sz Theta Function and a Semidefinite Programming Relaxation of Vertex Cover}, journal = {{SIAM} J. Discret. Math.}, volume = {11}, number = {2}, pages = {196--204}, year = {1998} }
@inproceedings{DBLP:conf/focs/DinitzGG98, author = {Yefim Dinitz and Naveen Garg and Michel X. Goemans}, title = {On the Single-Source Unsplittable Flow Problem}, booktitle = {{FOCS}}, pages = {290--299}, publisher = {{IEEE} Computer Society}, year = {1998} }
@article{DBLP:journals/mp/Goemans97, author = {Michel X. Goemans}, title = {Semidefinite programming in combinatorial optimization}, journal = {Math. Program.}, volume = {79}, pages = {143--161}, year = {1997} }
@inproceedings{DBLP:conf/soda/Goemans97, author = {Michel X. Goemans}, title = {Improved Approximation Algorithms for Scheduling with Release Dates}, booktitle = {{SODA}}, pages = {591--598}, publisher = {{ACM/SIAM}}, year = {1997} }
@article{DBLP:journals/informs/WilliamsonG96, author = {David P. Williamson and Michel X. Goemans}, title = {Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances}, journal = {{INFORMS} J. Comput.}, volume = {8}, number = {1}, pages = {29--40}, year = {1996} }
@inproceedings{DBLP:conf/cocoon/AndrewsGZ96, author = {Matthew Andrews and Michel X. Goemans and Lisa Zhang}, title = {Improved Bounds for On-line Load Balancing}, booktitle = {{COCOON}}, series = {Lecture Notes in Computer Science}, volume = {1090}, pages = {1--10}, publisher = {Springer}, year = {1996} }
@inproceedings{DBLP:conf/ipco/GoemansW96, author = {Michel X. Goemans and David P. Williamson}, title = {Primal-Dual Approximation Algorithms for Feedback Problems}, booktitle = {{IPCO}}, series = {Lecture Notes in Computer Science}, volume = {1084}, pages = {147--161}, publisher = {Springer}, year = {1996} }
@inproceedings{DBLP:conf/ipco/Goemans96, author = {Michel X. Goemans}, title = {A Supermodular Relaxation for Scheduling with Release Dates}, booktitle = {{IPCO}}, series = {Lecture Notes in Computer Science}, volume = {1084}, pages = {288--300}, publisher = {Springer}, year = {1996} }
@inproceedings{DBLP:conf/ipco/GoemansH96, author = {Michel X. Goemans and Leslie A. Hall}, title = {The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown}, booktitle = {{IPCO}}, series = {Lecture Notes in Computer Science}, volume = {1084}, pages = {415--429}, publisher = {Springer}, year = {1996} }
@inproceedings{DBLP:conf/soda/GoemansK96, author = {Michel X. Goemans and Jon M. Kleinberg}, title = {An Improved Approximation Ratio for the Minimum Latency Problem}, booktitle = {{SODA}}, pages = {152--158}, publisher = {{ACM/SIAM}}, year = {1996} }
@inproceedings{DBLP:conf/swat/RaviG96, author = {R. Ravi and Michel X. Goemans}, title = {The Constrained Minimum Spanning Tree Problem (Extended Abstract)}, booktitle = {{SWAT}}, series = {Lecture Notes in Computer Science}, volume = {1097}, pages = {66--75}, publisher = {Springer}, year = {1996} }
@article{DBLP:journals/combinatorica/WilliamsonGMV95, author = {David P. Williamson and Michel X. Goemans and Milena Mihail and Vijay V. Vazirani}, title = {A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems}, journal = {Comb.}, volume = {15}, number = {3}, pages = {435--454}, year = {1995} }
@article{DBLP:journals/combinatorica/GoemansR95, author = {Michel X. Goemans and V. S. Ramakrishnan}, title = {Minimizing Submodular Functions over Families of Sets}, journal = {Comb.}, volume = {15}, number = {4}, pages = {499--513}, year = {1995} }
@article{DBLP:journals/dam/Goemans95, author = {Michel X. Goemans}, title = {An Approximation Algorithm for Scheduling on Three Dedicated Machines}, journal = {Discret. Appl. Math.}, volume = {61}, number = {1}, pages = {49--59}, year = {1995} }
@article{DBLP:journals/jacm/GoemansW95, author = {Michel X. Goemans and David P. Williamson}, title = {Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming}, journal = {J. {ACM}}, volume = {42}, number = {6}, pages = {1115--1145}, year = {1995} }
@article{DBLP:journals/mp/Goemans95, author = {Michel X. Goemans}, title = {Worst-case comparison of valid inequalities for the {TSP}}, journal = {Math. Program.}, volume = {69}, pages = {335--349}, year = {1995} }
@article{DBLP:journals/siamcomp/GoemansW95, author = {Michel X. Goemans and David P. Williamson}, title = {A General Approximation Technique for Constrained Forest Problems}, journal = {{SIAM} J. Comput.}, volume = {24}, number = {2}, pages = {296--317}, year = {1995} }
@inproceedings{DBLP:conf/istcs/FeigeG95, author = {Uriel Feige and Michel X. Goemans}, title = {Aproximating the Value of Two Prover Proof Systems, With Applications to {MAX} 2SAT and {MAX} {DICUT}}, booktitle = {{ISTCS}}, pages = {182--189}, publisher = {{IEEE} Computer Society}, year = {1995} }
@article{DBLP:journals/cpc/FurediGK94, author = {Zolt{\'{a}}n F{\"{u}}redi and Michel X. Goemans and Daniel J. Kleitman}, title = {On the Maximum Number of Triangles in Wheel-Free Graphs}, journal = {Comb. Probab. Comput.}, volume = {3}, pages = {63--75}, year = {1994} }
@article{DBLP:journals/dam/Goemans94, author = {Michel X. Goemans}, title = {Arborescence Polytopes for Series-parallel Graphs}, journal = {Discret. Appl. Math.}, volume = {51}, number = {3}, pages = {277--289}, year = {1994} }
@article{DBLP:journals/mp/Goemans94, author = {Michel X. Goemans}, title = {The Steiner tree polytope and related polyhedra}, journal = {Math. Program.}, volume = {63}, pages = {157--182}, year = {1994} }
@article{DBLP:journals/orl/GoemansW94, author = {Michel X. Goemans and David P. Williamson}, title = {Approximating minimum-cost graph problems with spanning tree edges}, journal = {Oper. Res. Lett.}, volume = {16}, number = {4}, pages = {183--189}, year = {1994} }
@article{DBLP:journals/siamdm/GoemansW94, author = {Michel X. Goemans and David P. Williamson}, title = {New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem}, journal = {{SIAM} J. Discret. Math.}, volume = {7}, number = {4}, pages = {656--666}, year = {1994} }
@inproceedings{DBLP:conf/soda/GoemansGPSTW94, author = {Michel X. Goemans and Andrew V. Goldberg and Serge A. Plotkin and David B. Shmoys and {\'{E}}va Tardos and David P. Williamson}, title = {Improved Approximation Algorithms for Network Design Problems}, booktitle = {{SODA}}, pages = {223--232}, publisher = {{ACM/SIAM}}, year = {1994} }
@inproceedings{DBLP:conf/soda/WilliamsonG94, author = {David P. Williamson and Michel X. Goemans}, title = {Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances}, booktitle = {{SODA}}, pages = {355--364}, publisher = {{ACM/SIAM}}, year = {1994} }
@inproceedings{DBLP:conf/stoc/GoemansW94, author = {Michel X. Goemans and David P. Williamson}, title = {.879-approximation algorithms for {MAX} {CUT} and {MAX} 2SAT}, booktitle = {{STOC}}, pages = {422--431}, publisher = {{ACM}}, year = {1994} }
@article{DBLP:journals/corr/GoemansLS94, author = {Michel X. Goemans and Nancy A. Lynch and Isaac Saias}, title = {Number of faults a system can withstand without repairs}, journal = {CoRR}, volume = {abs/math/9409220}, year = {1994} }
@article{DBLP:journals/dm/Goemans93, author = {Michel X. Goemans}, title = {A generalization of Petersen's theorem}, journal = {Discret. Math.}, volume = {115}, number = {1-3}, pages = {277--282}, year = {1993} }
@article{DBLP:journals/mor/GoemansK93, author = {Michel X. Goemans and Muralidharan S. Kodialam}, title = {A Lower Bound on the Expected Cost of an Optimal Assignment}, journal = {Math. Oper. Res.}, volume = {18}, number = {2}, pages = {267--274}, year = {1993} }
@article{DBLP:journals/mp/BienstockGSW93, author = {Daniel Bienstock and Michel X. Goemans and David Simchi{-}Levi and David P. Williamson}, title = {A note on the prize collecting traveling salesman problem}, journal = {Math. Program.}, volume = {59}, pages = {413--420}, year = {1993} }
@article{DBLP:journals/mp/GoemansB93, author = {Michel X. Goemans and Dimitris Bertsimas}, title = {Survivable networks, linear programming relaxations and the parsimonious property}, journal = {Math. Program.}, volume = {60}, pages = {145--166}, year = {1993} }
@article{DBLP:journals/networks/GoemansM93, author = {Michel X. Goemans and Young{-}Soo Myung}, title = {A catalog of steiner tree formulations}, journal = {Networks}, volume = {23}, number = {1}, pages = {19--28}, year = {1993} }
@inproceedings{DBLP:conf/ipco/GabowGW93, author = {Harold N. Gabow and Michel X. Goemans and David P. Williamson}, title = {An efficient approximation algorithm for the survivable network design problem}, booktitle = {{IPCO}}, pages = {57--74}, publisher = {{CIACO}}, year = {1993} }
@inproceedings{DBLP:conf/ipco/GoemansW93, author = {Michel X. Goemans and David P. Williamson}, title = {A new {\textbackslash}frac34-approximation algorithm for {MAX} {SAT}}, booktitle = {{IPCO}}, pages = {313--321}, publisher = {{CIACO}}, year = {1993} }
@inproceedings{DBLP:conf/stoc/WilliamsonGMV93, author = {David P. Williamson and Michel X. Goemans and Milena Mihail and Vijay V. Vazirani}, title = {A primal-dual approximation algorithm for generalized Steiner network problems}, booktitle = {{STOC}}, pages = {708--717}, publisher = {{ACM}}, year = {1993} }
@inproceedings{DBLP:conf/ipco/Goemans92, author = {Michel X. Goemans}, title = {Polyhedral Description of Trees and Arborescences}, booktitle = {{IPCO}}, pages = {1--14}, publisher = {Carnegie Mellon University}, year = {1992} }
@inproceedings{DBLP:conf/soda/GoemansW92, author = {Michel X. Goemans and David P. Williamson}, title = {A General Approximation Technique for Constrained Forest Problems}, booktitle = {{SODA}}, pages = {307--316}, publisher = {{ACM/SIAM}}, year = {1992} }
@article{DBLP:journals/mor/GoemansB91, author = {Michel X. Goemans and Dimitris J. Bertsimas}, title = {Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem}, journal = {Math. Oper. Res.}, volume = {16}, number = {1}, pages = {72--89}, year = {1991} }
@article{DBLP:journals/orl/GoemansT91, author = {Michel X. Goemans and Kalyan T. Talluri}, title = {2-Change for k-connected networks}, journal = {Oper. Res. Lett.}, volume = {10}, number = {2}, pages = {113--117}, year = {1991} }
@inproceedings{DBLP:conf/soda/GoemansB90, author = {Michel X. Goemans and Dimitris Bertsimas}, title = {On the Parsimonious Property of Connectivity Problems}, booktitle = {{SODA}}, pages = {388--396}, publisher = {{SIAM}}, year = {1990} }
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.