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}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Shrunk subspaces via operator Sinkhorn iteration}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {1655--1668}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch62}, doi = {10.1137/1.9781611977554.CH62}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FranksSG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.48550/arXiv.2207.08311}, doi = {10.48550/ARXIV.2207.08311}, eprinttype = {arXiv}, eprint = {2207.08311}, timestamp = {Tue, 19 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-08311.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1145/3421750}, doi = {10.1145/3421750}, timestamp = {Mon, 30 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GoemansR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1910.00994}, eprinttype = {arXiv}, eprint = {1910.00994}, timestamp = {Fri, 04 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1910-00994.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://eccc.weizmann.ac.il/report/2019/135}, eprinttype = {ECCC}, eprint = {TR19-135}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoemansGH19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1807.02884}, eprinttype = {arXiv}, eprint = {1807.02884}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-02884.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/opre.2017.1603}, doi = {10.1287/OPRE.2017.1603}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ior/AsadpourGMGS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.2016.0825}, doi = {10.1287/MOOR.2016.0825}, timestamp = {Thu, 24 Aug 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mor/FujishigeGHPZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GoemansU17, author = {Michel X. Goemans and Francisco Unda}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Williamson and Santosh S. Vempala}, title = {Approximating Incremental Combinatorial Optimization Problems}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {81}, pages = {6:1--6:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.6}, doi = {10.4230/LIPICS.APPROX-RANDOM.2017.6}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/GoemansU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GoemansGJ17, author = {Michel X. Goemans and Swati Gupta and Patrick Jaillet}, editor = {Friedrich Eisenbrand and Jochen K{\"{o}}nemann}, title = {Discrete Newton's Algorithm for Parametric Submodular Function Minimization}, booktitle = {Integer Programming and Combinatorial Optimization - 19th International Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10328}, pages = {212--227}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-59250-3\_18}, doi = {10.1007/978-3-319-59250-3\_18}, timestamp = {Thu, 07 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ipco/GoemansGJ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1705.02973}, eprinttype = {arXiv}, eprint = {1705.02973}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KimBG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1603.00522}, eprinttype = {arXiv}, eprint = {1603.00522}, timestamp = {Thu, 07 Dec 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/GuptaGJ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/s10107-014-0757-1}, doi = {10.1007/S10107-014-0757-1}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Goemans15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/j.orl.2015.04.002}, doi = {10.1016/J.ORL.2015.04.002}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/FujishigeGHPZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1504.07545}, eprinttype = {arXiv}, eprint = {1504.07545}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FujishigeGHPZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansR14, author = {Michel X. Goemans and Thomas Rothvo{\ss}}, editor = {Chandra Chekuri}, title = {Polynomiality for Bin Packing with a Constant Number of Item Types}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {830--839}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.61}, doi = {10.1137/1.9781611973402.61}, timestamp = {Tue, 02 Feb 2021 17:07:40 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoemansR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/CheungGW14, author = {Wang Chi Cheung and Michel X. Goemans and Sam Chiu{-}wai Wong}, editor = {Chandra Chekuri}, title = {Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014}, pages = {1714--1726}, publisher = {{SIAM}}, year = {2014}, url = {https://doi.org/10.1137/1.9781611973402.124}, doi = {10.1137/1.9781611973402.124}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/CheungGW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/120891502}, doi = {10.1137/120891502}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GoemansS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/978-3-642-36694-9}, doi = {10.1007/978-3-642-36694-9}, isbn = {978-3-642-36693-2}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1307.5108}, eprinttype = {arXiv}, eprint = {1307.5108}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GoemansR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/s10107-011-0446-2}, doi = {10.1007/S10107-011-0446-2}, timestamp = {Wed, 16 May 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GoemansIZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoemansORZ12, author = {Michel X. Goemans and Neil Olver and Thomas Rothvo{\ss} and Rico Zenklusen}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Matroids and integrality gaps for hypergraphic steiner tree relaxations}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {1161--1176}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214081}, doi = {10.1145/2213977.2214081}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoemansORZ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.1110.0499}, doi = {10.1287/MOOR.1110.0499}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mor/FleischerGMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1111.7280}, eprinttype = {arXiv}, eprint = {1111.7280}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-7280.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AsadpourGMGS10, author = {Arash Asadpour and Michel X. Goemans and Aleksander Madry and Shayan Oveis Gharan and Amin Saberi}, editor = {Moses Charikar}, title = {An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem}, booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010}, pages = {379--389}, publisher = {{SIAM}}, year = {2010}, url = {https://doi.org/10.1137/1.9781611973075.32}, doi = {10.1137/1.9781611973075.32}, timestamp = {Tue, 02 Feb 2021 17:07:39 +0100}, biburl = {https://dblp.org/rec/conf/soda/AsadpourGMGS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/1007.2140}, eprinttype = {arXiv}, eprint = {1007.2140}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1007-2140.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1002/net.20289}, doi = {10.1002/NET.20289}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/networks/GabowGTW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/allerton/GoemansIZ09, author = {Michel X. Goemans and Satoru Iwata and Rico Zenklusen}, title = {An algorithmic framework for wireless information flow}, booktitle = {47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, Monticello, IL, USA, September 30 - October 2, 2009}, pages = {294--300}, publisher = {{IEEE}}, year = {2009}, url = {https://doi.org/10.1109/ALLERTON.2009.5394810}, doi = {10.1109/ALLERTON.2009.5394810}, timestamp = {Wed, 29 Nov 2023 20:15:57 +0100}, biburl = {https://dblp.org/rec/conf/allerton/GoemansIZ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansHIM09, author = {Michel X. Goemans and Nicholas J. A. Harvey and Satoru Iwata and Vahab S. Mirrokni}, editor = {Claire Mathieu}, title = {Approximating submodular functions everywhere}, booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009}, pages = {535--544}, publisher = {{SIAM}}, year = {2009}, url = {https://doi.org/10.1137/1.9781611973068.59}, doi = {10.1137/1.9781611973068.59}, timestamp = {Mon, 12 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansHIM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/0909.0941}, eprinttype = {arXiv}, eprint = {0909.0941}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0909-0941.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/0910.0553}, eprinttype = {arXiv}, eprint = {0910.0553}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0910-0553.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.1080.0330}, doi = {10.1287/MOOR.1080.0330}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mor/DeanGV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/060656413}, doi = {10.1137/060656413}, timestamp = {Mon, 29 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/CorreaG07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1109/JSAC.2006.872884}, doi = {10.1109/JSAC.2006.872884}, timestamp = {Fri, 29 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jsac/GoemansLMT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.1060.0191}, doi = {10.1287/MOOR.1060.0191}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mor/CharikarGK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1002/rsa.20115}, doi = {10.1002/RSA.20115}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/GoemansV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://doi.acm.org/10.1145/1217706}, doi = {10.1145/1217706}, timestamp = {Wed, 16 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ton/RosenblumCGT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DeanGI06, author = {Brian C. Dean and Michel X. Goemans and Nicole Immorlica}, editor = {Yossi Azar and Thomas Erlebach}, title = {Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data}, booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4168}, pages = {268--279}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11841036\_26}, doi = {10.1007/11841036\_26}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/DeanGI06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Goemans06, author = {Michel X. Goemans}, title = {Minimum Bounded Degree Spanning Trees}, booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings}, pages = {273--282}, publisher = {{IEEE} Computer Society}, year = {2006}, url = {https://doi.org/10.1109/FOCS.2006.48}, doi = {10.1109/FOCS.2006.48}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Goemans06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifipTCS/DeanGI06, author = {Brian C. Dean and Michel X. Goemans and Nicole Immorlica}, editor = {Gonzalo Navarro and Leopoldo E. Bertossi and Yoshiharu Kohayakawa}, title = {The Unsplittable Stable Marriage Problem}, booktitle = {Fourth {IFIP} International Conference on Theoretical Computer Science {(TCS} 2006), {IFIP} 19th World Computer Congress, {TC-1} Foundations of Computer Science, August 23-24, 2006, Santiago, Chile}, series = {{IFIP}}, volume = {209}, pages = {65--75}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/978-0-387-34735-6\_9}, doi = {10.1007/978-0-387-34735-6\_9}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/ifipTCS/DeanGI06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/GoemansV06, author = {Michel X. Goemans and Jan Vondr{\'{a}}k}, editor = {Jos{\'{e}} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, title = {Stochastic Covering and Adaptivity}, booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3887}, pages = {532--543}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11682462\_50}, doi = {10.1007/11682462\_50}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/GoemansV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {611--620}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109624}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/FleischerGMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/GoemansMV05, author = {Michel X. Goemans and Vahab S. Mirrokni and Adrian Vetta}, title = {Sink Equilibria and Convergence}, booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings}, pages = {142--154}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/SFCS.2005.68}, doi = {10.1109/SFCS.2005.68}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/GoemansMV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {395--404}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070487}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/DeanGV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {562--571}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070511}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GabowGTW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/S0196-6774(03)00098-1}, doi = {10.1016/S0196-6774(03)00098-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/GoemansS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/j.jcss.2003.07.012}, doi = {10.1016/J.JCSS.2003.07.012}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GoemansW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1002/net.20028}, doi = {10.1002/NET.20028}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/MacqG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19 October 2004, Rome, Italy, Proceedings}, pages = {101--107}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/FOCS.2004.45}, doi = {10.1109/FOCS.2004.45}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/CharikarGK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19 October 2004, Rome, Italy, Proceedings}, pages = {208--217}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/FOCS.2004.15}, doi = {10.1109/FOCS.2004.15}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DeanGV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Proceedings {IEEE} {INFOCOM} 2004, The 23rd Annual Joint Conference of the {IEEE} Computer and Communications Societies, Hong Kong, China, March 7-11, 2004}, pages = {1126--1134}, publisher = {{IEEE}}, year = {2004}, url = {https://doi.org/10.1109/INFCOM.2004.1356999}, doi = {10.1109/INFCOM.2004.1356999}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/infocom/RosenblumGT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mobihoc/GoemansLMT04, author = {Michel X. Goemans and Li (Erran) Li and Vahab S. Mirrokni and Marina Thottan}, editor = {Jun Murai and Charles E. Perkins and Leandros Tassiulas}, title = {Market sharing games applied to content distribution in ad-hoc networks}, booktitle = {Proceedings of the 5th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2004, Roppongi Hills, Tokyo, Japan, May 24-26, 2004}, pages = {55--66}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/989459.989467}, doi = {10.1145/989459.989467}, timestamp = {Fri, 29 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mobihoc/GoemansLMT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/MacqG04, author = {Jean{-}Fran{\c{c}}ois Macq and Michel X. Goemans}, editor = {J. Ian Munro}, title = {Trade-offs on the location of the core node in a network}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {597--604}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982882}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/MacqG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansV04, author = {Michel X. Goemans and Jan Vondr{\'{a}}k}, editor = {J. Ian Munro}, title = {Covering minimum spanning trees of random subgraphs}, booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14, 2004}, pages = {934--941}, publisher = {{SIAM}}, year = {2004}, url = {http://dl.acm.org/citation.cfm?id=982792.982933}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoemansV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CorreaG04, author = {Jos{\'{e}} R. Correa and Michel X. Goemans}, editor = {L{\'{a}}szl{\'{o}} Babai}, title = {An approximate K{\"{o}}nig's theorem for edge-coloring weighted bipartite graphs}, booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004}, pages = {398--406}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1007352.1007417}, doi = {10.1145/1007352.1007417}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CorreaG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/S0196-8858(03)00015-0}, doi = {10.1016/S0196-8858(03)00015-0}, timestamp = {Wed, 07 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aam/ChowFGV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DeanG03, author = {Brian C. Dean and Michel X. Goemans}, editor = {Jos C. M. Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger}, title = {Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling}, booktitle = {Automata, Languages and Programming, 30th International Colloquium, {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2719}, pages = {1138--1152}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-45061-0\_87}, doi = {10.1007/3-540-45061-0\_87}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DeanG03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, isbn = {1-58113-674-9}, timestamp = {Mon, 17 Oct 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/2003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/S089548019936223X}, doi = {10.1137/S089548019936223X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GoemansQSSW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.26.4.796.10012}, doi = {10.1287/MOOR.26.4.796.10012}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mor/GoemansT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/S0895480199358023}, doi = {10.1137/S0895480199358023}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Goemans01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Goemans01, author = {Michel X. Goemans}, editor = {Michel X. Goemans and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Luca Trevisan}, title = {Using Complex Semidefinite Programming for Approximating {MAX} {E2-LIN3}}, booktitle = {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}, pages = {1}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44666-4\_1}, doi = {10.1007/3-540-44666-4\_1}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/random/Goemans01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoemansW01, author = {Michel X. Goemans and David P. Williamson}, editor = {Jeffrey Scott Vitter and Paul G. Spirakis and Mihalis Yannakakis}, title = {Approximation algorithms for {MAX-3-CUT} and other problems via complex semidefinite programming}, booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece}, pages = {443--452}, publisher = {{ACM}}, year = {2001}, url = {https://doi.org/10.1145/380752.380838}, doi = {10.1145/380752.380838}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoemansW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/3-540-44666-4}, doi = {10.1007/3-540-44666-4}, isbn = {3-540-42470-9}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/2001.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/S0167-6377(00)00024-9}, doi = {10.1016/S0167-6377(00)00024-9}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/GoemansWW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/S0895480197330254}, doi = {10.1137/S0895480197330254}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GoemansW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansS00, author = {Michel X. Goemans and Martin Skutella}, editor = {David B. Shmoys}, title = {Cooperative facility location games}, booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, {USA}}, pages = {76--85}, publisher = {{ACM/SIAM}}, year = {2000}, url = {http://dl.acm.org/citation.cfm?id=338219.338238}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/GoemansS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/PL00009263}, doi = {10.1007/PL00009263}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsGZ99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/s004930050043}, doi = {10.1007/S004930050043}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/DinitzGG99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/s006070050038}, doi = {10.1007/S006070050038}, timestamp = {Thu, 06 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/computing/GoemansR99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansW99, author = {Michel X. Goemans and David P. Williamson}, editor = {Robert Endre Tarjan and Tandy J. Warnow}, title = {Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler}, booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, {USA}}, pages = {366--375}, publisher = {{ACM/SIAM}}, year = {1999}, url = {http://dl.acm.org/citation.cfm?id=314500.314589}, timestamp = {Thu, 05 Jul 2018 07:29:57 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/PL00009810}, doi = {10.1007/PL00009810}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/GoemansW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01585864}, doi = {10.1007/BF01585864}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GabowGW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01585867}, doi = {10.1007/BF01585867}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GoemansK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/S0167-6377(98)00021-2}, doi = {10.1016/S0167-6377(98)00021-2}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/ChudakGHW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/S0895480195287541}, doi = {10.1137/S0895480195287541}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KleinbergG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinitzGG98, author = {Yefim Dinitz and Naveen Garg and Michel X. Goemans}, title = {On the Single-Source Unsplittable Flow Problem}, booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98, November 8-11, 1998, Palo Alto, California, {USA}}, pages = {290--299}, publisher = {{IEEE} Computer Society}, year = {1998}, url = {https://doi.org/10.1109/SFCS.1998.743461}, doi = {10.1109/SFCS.1998.743461}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DinitzGG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF02614315}, doi = {10.1007/BF02614315}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/Goemans97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Goemans97, author = {Michel X. Goemans}, editor = {Michael E. Saks}, title = {Improved Approximation Algorithms for Scheduling with Release Dates}, booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}}, pages = {591--598}, publisher = {{ACM/SIAM}}, year = {1997}, url = {http://dl.acm.org/citation.cfm?id=314161.314394}, timestamp = {Thu, 05 Jul 2018 07:29:42 +0200}, biburl = {https://dblp.org/rec/conf/soda/Goemans97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/ijoc.8.1.29}, doi = {10.1287/IJOC.8.1.29}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/informs/WilliamsonG96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/AndrewsGZ96, author = {Matthew Andrews and Michel X. Goemans and Lisa Zhang}, editor = {Jin{-}yi Cai and C. K. Wong}, title = {Improved Bounds for On-line Load Balancing}, booktitle = {Computing and Combinatorics, Second Annual International Conference, {COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1090}, pages = {1--10}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61332-3\_133}, doi = {10.1007/3-540-61332-3\_133}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/AndrewsGZ96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GoemansW96, author = {Michel X. Goemans and David P. Williamson}, editor = {William H. Cunningham and S. Thomas McCormick and Maurice Queyranne}, title = {Primal-Dual Approximation Algorithms for Feedback Problems}, booktitle = {Integer Programming and Combinatorial Optimization, 5th International {IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1084}, pages = {147--161}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61310-2\_12}, doi = {10.1007/3-540-61310-2\_12}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GoemansW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Goemans96, author = {Michel X. Goemans}, editor = {William H. Cunningham and S. Thomas McCormick and Maurice Queyranne}, title = {A Supermodular Relaxation for Scheduling with Release Dates}, booktitle = {Integer Programming and Combinatorial Optimization, 5th International {IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1084}, pages = {288--300}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61310-2\_22}, doi = {10.1007/3-540-61310-2\_22}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Goemans96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GoemansH96, author = {Michel X. Goemans and Leslie A. Hall}, editor = {William H. Cunningham and S. Thomas McCormick and Maurice Queyranne}, title = {The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown}, booktitle = {Integer Programming and Combinatorial Optimization, 5th International {IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1084}, pages = {415--429}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61310-2\_31}, doi = {10.1007/3-540-61310-2\_31}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GoemansH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansK96, author = {Michel X. Goemans and Jon M. Kleinberg}, editor = {{\'{E}}va Tardos}, title = {An Improved Approximation Ratio for the Minimum Latency Problem}, booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}}, pages = {152--158}, publisher = {{ACM/SIAM}}, year = {1996}, url = {http://dl.acm.org/citation.cfm?id=313852.313909}, timestamp = {Thu, 05 Jul 2018 07:29:31 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansK96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/RaviG96, author = {R. Ravi and Michel X. Goemans}, editor = {Rolf G. Karlsson and Andrzej Lingas}, title = {The Constrained Minimum Spanning Tree Problem (Extended Abstract)}, booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1097}, pages = {66--75}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61422-2\_121}, doi = {10.1007/3-540-61422-2\_121}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/RaviG96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01299747}, doi = {10.1007/BF01299747}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/WilliamsonGMV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01192523}, doi = {10.1007/BF01192523}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/GoemansR95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/0166-218X(94)00160-F}, doi = {10.1016/0166-218X(94)00160-F}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Goemans95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1145/227683.227684}, doi = {10.1145/227683.227684}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/GoemansW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01585563}, doi = {10.1007/BF01585563}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Goemans95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/S0097539793242618}, doi = {10.1137/S0097539793242618}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/GoemansW95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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 = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS} 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings}, pages = {182--189}, publisher = {{IEEE} Computer Society}, year = {1995}, url = {https://doi.org/10.1109/ISTCS.1995.377033}, doi = {10.1109/ISTCS.1995.377033}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/istcs/FeigeG95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1017/S0963548300000985}, doi = {10.1017/S0963548300000985}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FurediGK94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/0166-218X(92)00035-K}, doi = {10.1016/0166-218X(92)00035-K}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Goemans94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01582064}, doi = {10.1007/BF01582064}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Goemans94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/0167-6377(94)90067-1}, doi = {10.1016/0167-6377(94)90067-1}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/GoemansW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1137/S0895480192243516}, doi = {10.1137/S0895480192243516}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GoemansW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, editor = {Daniel Dominic Sleator}, title = {Improved Approximation Algorithms for Network Design Problems}, booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, {USA}}, pages = {223--232}, publisher = {{ACM/SIAM}}, year = {1994}, url = {http://dl.acm.org/citation.cfm?id=314464.314497}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansGPSTW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/WilliamsonG94, author = {David P. Williamson and Michel X. Goemans}, editor = {Daniel Dominic Sleator}, title = {Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances}, booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, {USA}}, pages = {355--364}, publisher = {{ACM/SIAM}}, year = {1994}, url = {http://dl.acm.org/citation.cfm?id=314464.314568}, timestamp = {Fri, 07 Dec 2012 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/WilliamsonG94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoemansW94, author = {Michel X. Goemans and David P. Williamson}, editor = {Frank Thomson Leighton and Michael T. Goodrich}, title = {.879-approximation algorithms for {MAX} {CUT} and {MAX} 2SAT}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {422--431}, publisher = {{ACM}}, year = {1994}, url = {https://doi.org/10.1145/195058.195216}, doi = {10.1145/195058.195216}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoemansW94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {http://arxiv.org/abs/math/9409220}, eprinttype = {arXiv}, eprint = {math/9409220}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GoemansLS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/0012-365X(93)90497-H}, doi = {10.1016/0012-365X(93)90497-H}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Goemans93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.18.2.267}, doi = {10.1287/MOOR.18.2.267}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mor/GoemansK93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01581256}, doi = {10.1007/BF01581256}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/BienstockGSW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1007/BF01580607}, doi = {10.1007/BF01580607}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/GoemansB93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1002/net.3230230104}, doi = {10.1002/NET.3230230104}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/GoemansM93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GabowGW93, author = {Harold N. Gabow and Michel X. Goemans and David P. Williamson}, editor = {Giovanni Rinaldi and Laurence A. Wolsey}, title = {An efficient approximation algorithm for the survivable network design problem}, booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993}, pages = {57--74}, publisher = {{CIACO}}, year = {1993}, timestamp = {Wed, 09 Oct 2002 11:26:33 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GabowGW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/GoemansW93, author = {Michel X. Goemans and David P. Williamson}, editor = {Giovanni Rinaldi and Laurence A. Wolsey}, title = {A new {\textbackslash}frac34-approximation algorithm for {MAX} {SAT}}, booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993}, pages = {313--321}, publisher = {{CIACO}}, year = {1993}, timestamp = {Wed, 09 Oct 2002 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ipco/GoemansW93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/WilliamsonGMV93, author = {David P. Williamson and Michel X. Goemans and Milena Mihail and Vijay V. Vazirani}, editor = {S. Rao Kosaraju and David S. Johnson and Alok Aggarwal}, title = {A primal-dual approximation algorithm for generalized Steiner network problems}, booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, {USA}}, pages = {708--717}, publisher = {{ACM}}, year = {1993}, url = {https://doi.org/10.1145/167088.167268}, doi = {10.1145/167088.167268}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/WilliamsonGMV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ipco/Goemans92, author = {Michel X. Goemans}, editor = {Egon Balas and G{\'{e}}rard Cornu{\'{e}}jols and Ravi Kannan}, title = {Polyhedral Description of Trees and Arborescences}, booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992}, pages = {1--14}, publisher = {Carnegie Mellon University}, year = {1992}, timestamp = {Thu, 21 Jun 2018 07:38:51 +0200}, biburl = {https://dblp.org/rec/conf/ipco/Goemans92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansW92, author = {Michel X. Goemans and David P. Williamson}, editor = {Greg N. Frederickson}, title = {A General Approximation Technique for Constrained Forest Problems}, booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, {USA}}, pages = {307--316}, publisher = {{ACM/SIAM}}, year = {1992}, url = {http://dl.acm.org/citation.cfm?id=139404.139468}, timestamp = {Thu, 05 Jul 2018 07:29:02 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansW92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1287/moor.16.1.72}, doi = {10.1287/MOOR.16.1.72}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mor/GoemansB91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@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}, url = {https://doi.org/10.1016/0167-6377(91)90096-8}, doi = {10.1016/0167-6377(91)90096-8}, timestamp = {Fri, 31 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/GoemansT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GoemansB90, author = {Michel X. Goemans and Dimitris Bertsimas}, editor = {David S. Johnson}, title = {On the Parsimonious Property of Connectivity Problems}, booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, {USA}}, pages = {388--396}, publisher = {{SIAM}}, year = {1990}, url = {http://dl.acm.org/citation.cfm?id=320176.320224}, timestamp = {Thu, 05 Jul 2018 07:28:50 +0200}, biburl = {https://dblp.org/rec/conf/soda/GoemansB90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.