BibTeX records: Michel X. Goemans

download as .bib file

@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   = {Operations Research},
  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 = {Thu, 10 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ior/AsadpourGMGS17},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mor/FujishigeGHPZ17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/approx/GoemansU17,
  author    = {Michel X. Goemans and
               Francisco Unda},
  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}},
  pages     = {6:1--6:14},
  year      = {2017},
  crossref  = {DBLP:conf/approx/2017},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.6},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2017.6},
  timestamp = {Tue, 15 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/GoemansU17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Integer Programming and Combinatorial Optimization - 19th International
               Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
  pages     = {212--227},
  year      = {2017},
  crossref  = {DBLP:conf/ipco/2017},
  url       = {https://doi.org/10.1007/978-3-319-59250-3_18},
  doi       = {10.1007/978-3-319-59250-3_18},
  timestamp = {Tue, 06 Jun 2017 17:32:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GoemansGJ17},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/KimBG17},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GuptaGJ16},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mp/Goemans15},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/orl/FujishigeGHPZ15},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FujishigeGHPZ15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages     = {830--839},
  year      = {2014},
  crossref  = {DBLP:conf/soda/2014},
  url       = {https://doi.org/10.1137/1.9781611973402.61},
  doi       = {10.1137/1.9781611973402.61},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansR14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages     = {1714--1726},
  year      = {2014},
  crossref  = {DBLP:conf/soda/2014},
  url       = {https://doi.org/10.1137/1.9781611973402.124},
  doi       = {10.1137/1.9781611973402.124},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/CheungGW14},
  bibsource = {dblp computer science bibliography, http://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. Discrete Math.},
  volume    = {27},
  number    = {2},
  pages     = {1123--1145},
  year      = {2013},
  url       = {https://doi.org/10.1137/120891502},
  doi       = {10.1137/120891502},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/GoemansS13},
  bibsource = {dblp computer science bibliography, http://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 = {Mon, 22 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/2013},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GoemansR13},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/GoemansIZ12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the 44th Symposium on Theory of Computing Conference,
               {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  pages     = {1161--1176},
  year      = {2012},
  crossref  = {DBLP:conf/stoc/2012},
  url       = {http://doi.acm.org/10.1145/2213977.2214081},
  doi       = {10.1145/2213977.2214081},
  timestamp = {Tue, 22 May 2012 21:36:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GoemansORZ12},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mor/FleischerGMS11},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1111-7280},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages     = {379--389},
  year      = {2010},
  crossref  = {DBLP:conf/soda/2010},
  url       = {https://doi.org/10.1137/1.9781611973075.32},
  doi       = {10.1137/1.9781611973075.32},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/AsadpourGMGS10},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1007-2140},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/networks/GabowGTW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {535--544},
  year      = {2009},
  crossref  = {DBLP:conf/soda/2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496829},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansHIM09},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0909-0941},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0910-0553},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mor/DeanGV08},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/CorreaG07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jsac/GoemansLMT06,
  author    = {Michel X. Goemans and
               Erran L. Li and
               Vahab S. Mirrokni and
               Marina Thottan},
  title     = {Market sharing games applied to content distribution in ad hoc networks},
  journal   = {{IEEE} Journal on Selected Areas in Communications},
  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, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jsac/GoemansLMT06},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mor/CharikarGK06},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/rsa/GoemansV06},
  bibsource = {dblp computer science bibliography, http://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    = {16},
  number    = {6},
  pages     = {1374--1387},
  year      = {2006},
  url       = {http://doi.acm.org/10.1145/1217706},
  doi       = {10.1145/1217706},
  timestamp = {Fri, 16 Feb 2007 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/ton/RosenblumCGT06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
               September 11-13, 2006, Proceedings},
  pages     = {268--279},
  year      = {2006},
  crossref  = {DBLP:conf/esa/2006},
  url       = {https://doi.org/10.1007/11841036_26},
  doi       = {10.1007/11841036_26},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/DeanGI06},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2006},
  crossref  = {DBLP:conf/focs/2006},
  url       = {https://doi.org/10.1109/FOCS.2006.48},
  doi       = {10.1109/FOCS.2006.48},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/Goemans06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/DeanGI06,
  author    = {Brian C. Dean and
               Michel X. Goemans and
               Nicole Immorlica},
  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},
  pages     = {65--75},
  year      = {2006},
  crossref  = {DBLP:conf/ifipTCS/2006},
  url       = {https://doi.org/10.1007/978-0-387-34735-6_9},
  doi       = {10.1007/978-0-387-34735-6_9},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ifipTCS/DeanGI06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/latin/GoemansV06,
  author    = {Michel X. Goemans and
               Jan Vondr{\'{a}}k},
  title     = {Stochastic Covering and Adaptivity},
  booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
               Valdivia, Chile, March 20-24, 2006, Proceedings},
  pages     = {532--543},
  year      = {2006},
  crossref  = {DBLP:conf/latin/2006},
  url       = {https://doi.org/10.1007/11682462_50},
  doi       = {10.1007/11682462_50},
  timestamp = {Sun, 04 Jun 2017 10:09:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/latin/GoemansV06},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2006},
  crossref  = {DBLP:conf/soda/2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109624},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/FleischerGMS06},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2005},
  crossref  = {DBLP:conf/focs/2005},
  url       = {https://doi.org/10.1109/SFCS.2005.68},
  doi       = {10.1109/SFCS.2005.68},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/GoemansMV05},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2005},
  crossref  = {DBLP:conf/soda/2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432.1070487},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/DeanGV05},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2005},
  crossref  = {DBLP:conf/soda/2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432.1070511},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GabowGTW05},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/jal/GoemansS04},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/GoemansW04},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/networks/MacqG04},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2004},
  crossref  = {DBLP:conf/focs/2004},
  url       = {https://doi.org/10.1109/FOCS.2004.45},
  doi       = {10.1109/FOCS.2004.45},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/CharikarGK04},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2004},
  crossref  = {DBLP:conf/focs/2004},
  url       = {https://doi.org/10.1109/FOCS.2004.15},
  doi       = {10.1109/FOCS.2004.15},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/DeanGV04},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {2004},
  crossref  = {DBLP:conf/infocom/2004},
  url       = {https://doi.org/10.1109/INFCOM.2004.1356999},
  doi       = {10.1109/INFCOM.2004.1356999},
  timestamp = {Tue, 16 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/infocom/RosenblumGT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mobihoc/GoemansLMT04,
  author    = {Michel X. Goemans and
               Erran L. Li and
               Vahab S. Mirrokni and
               Marina Thottan},
  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},
  year      = {2004},
  crossref  = {DBLP:conf/mobihoc/2004},
  url       = {http://doi.acm.org/10.1145/989459.989467},
  doi       = {10.1145/989459.989467},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/mobihoc/GoemansLMT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  pages     = {597--604},
  year      = {2004},
  crossref  = {DBLP:conf/soda/2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792.982882},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/MacqG04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansV04,
  author    = {Michel X. Goemans and
               Jan Vondr{\'{a}}k},
  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},
  year      = {2004},
  crossref  = {DBLP:conf/soda/2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792.982933},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansV04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  pages     = {398--406},
  year      = {2004},
  crossref  = {DBLP:conf/stoc/2004},
  url       = {http://doi.acm.org/10.1145/1007352.1007417},
  doi       = {10.1145/1007352.1007417},
  timestamp = {Wed, 15 Feb 2006 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/CorreaG04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DeanG03,
  author    = {Brian C. Dean and
               Michel X. Goemans},
  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},
  pages     = {1138--1152},
  year      = {2003},
  crossref  = {DBLP:conf/icalp/2003},
  url       = {https://doi.org/10.1007/3-540-45061-0_87},
  doi       = {10.1007/3-540-45061-0_87},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/DeanG03},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/conf/stoc/2003},
  bibsource = {dblp computer science bibliography, http://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. Discrete Math.},
  volume    = {15},
  number    = {2},
  pages     = {165--192},
  year      = {2002},
  url       = {https://doi.org/10.1137/S089548019936223X},
  doi       = {10.1137/S089548019936223X},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/GoemansQSSW02},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mor/GoemansT01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamdm/Goemans01,
  author    = {Michel X. Goemans},
  title     = {Approximate Edge Splitting},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {14},
  number    = {1},
  pages     = {138--141},
  year      = {2001},
  url       = {https://doi.org/10.1137/S0895480199358023},
  doi       = {10.1137/S0895480199358023},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/Goemans01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/random/Goemans01,
  author    = {Michel X. Goemans},
  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},
  pages     = {1},
  year      = {2001},
  crossref  = {DBLP:conf/random/2001},
  url       = {https://doi.org/10.1007/3-540-44666-4_1},
  doi       = {10.1007/3-540-44666-4_1},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/random/Goemans01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
               July 6-8, 2001, Heraklion, Crete, Greece},
  pages     = {443--452},
  year      = {2001},
  crossref  = {DBLP:conf/stoc/2001},
  url       = {http://doi.acm.org/10.1145/380752.380838},
  doi       = {10.1145/380752.380838},
  timestamp = {Thu, 16 Feb 2012 12:04:51 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GoemansW01},
  bibsource = {dblp computer science bibliography, http://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 = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/random/2001},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/orl/GoemansWW00},
  bibsource = {dblp computer science bibliography, http://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. Discrete Math.},
  volume    = {13},
  number    = {3},
  pages     = {281--294},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0895480197330254},
  doi       = {10.1137/S0895480197330254},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/GoemansW00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansS00,
  author    = {Michel X. Goemans and
               Martin Skutella},
  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},
  year      = {2000},
  crossref  = {DBLP:conf/soda/2000},
  url       = {http://dl.acm.org/citation.cfm?id=338219.338238},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansS00},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/algorithmica/AndrewsGZ99},
  bibsource = {dblp computer science bibliography, http://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   = {Combinatorica},
  volume    = {19},
  number    = {1},
  pages     = {17--41},
  year      = {1999},
  url       = {https://doi.org/10.1007/s004930050043},
  doi       = {10.1007/s004930050043},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/DinitzGG99},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/computing/GoemansR99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland.},
  pages     = {366--375},
  year      = {1999},
  crossref  = {DBLP:conf/soda/1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500.314589},
  timestamp = {Mon, 14 Mar 2016 15:38:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansW99},
  bibsource = {dblp computer science bibliography, http://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   = {Combinatorica},
  volume    = {18},
  number    = {1},
  pages     = {37--59},
  year      = {1998},
  url       = {https://doi.org/10.1007/PL00009810},
  doi       = {10.1007/PL00009810},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/GoemansW98},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mp/GabowGW98},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mp/GoemansK98},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/orl/ChudakGHW98},
  bibsource = {dblp computer science bibliography, http://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. Discrete Math.},
  volume    = {11},
  number    = {2},
  pages     = {196--204},
  year      = {1998},
  url       = {https://doi.org/10.1137/S0895480195287541},
  doi       = {10.1137/S0895480195287541},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/KleinbergG98},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1998},
  crossref  = {DBLP:conf/focs/1998},
  url       = {https://doi.org/10.1109/SFCS.1998.743461},
  doi       = {10.1109/SFCS.1998.743461},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/DinitzGG98},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/Goemans97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/Goemans97,
  author    = {Michel X. Goemans},
  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.},
  pages     = {591--598},
  year      = {1997},
  crossref  = {DBLP:conf/soda/1997},
  url       = {http://dl.acm.org/citation.cfm?id=314161.314394},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/Goemans97},
  bibsource = {dblp computer science bibliography, http://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} Journal on Computing},
  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, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/informs/WilliamsonG96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AndrewsGZ96,
  author    = {Matthew Andrews and
               Michel X. Goemans and
               Lisa Zhang},
  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},
  pages     = {1--10},
  year      = {1996},
  crossref  = {DBLP:conf/cocoon/1996},
  url       = {https://doi.org/10.1007/3-540-61332-3_133},
  doi       = {10.1007/3-540-61332-3_133},
  timestamp = {Mon, 22 May 2017 16:14:05 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/AndrewsGZ96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GoemansW96,
  author    = {Michel X. Goemans and
               David P. Williamson},
  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},
  pages     = {147--161},
  year      = {1996},
  crossref  = {DBLP:conf/ipco/1996},
  url       = {https://doi.org/10.1007/3-540-61310-2_12},
  doi       = {10.1007/3-540-61310-2_12},
  timestamp = {Mon, 22 May 2017 16:14:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GoemansW96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Goemans96,
  author    = {Michel X. Goemans},
  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},
  pages     = {288--300},
  year      = {1996},
  crossref  = {DBLP:conf/ipco/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 16:14:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/Goemans96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Integer Programming and Combinatorial Optimization, 5th International
               {IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
               1996, Proceedings},
  pages     = {415--429},
  year      = {1996},
  crossref  = {DBLP:conf/ipco/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 16:14:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GoemansH96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansK96,
  author    = {Michel X. Goemans and
               Jon M. Kleinberg},
  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.},
  pages     = {152--158},
  year      = {1996},
  crossref  = {DBLP:conf/soda/1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852.313909},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansK96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/swat/RaviG96,
  author    = {R. Ravi and
               Michel X. Goemans},
  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},
  pages     = {66--75},
  year      = {1996},
  crossref  = {DBLP:conf/swat/1996},
  url       = {https://doi.org/10.1007/3-540-61422-2_121},
  doi       = {10.1007/3-540-61422-2_121},
  timestamp = {Mon, 22 May 2017 16:14:05 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/swat/RaviG96},
  bibsource = {dblp computer science bibliography, http://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   = {Combinatorica},
  volume    = {15},
  number    = {3},
  pages     = {435--454},
  year      = {1995},
  url       = {https://doi.org/10.1007/BF01299747},
  doi       = {10.1007/BF01299747},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/WilliamsonGMV95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/combinatorica/GoemansR95,
  author    = {Michel X. Goemans and
               V. S. Ramakrishnan},
  title     = {Minimizing Submodular Functions over Families of Sets},
  journal   = {Combinatorica},
  volume    = {15},
  number    = {4},
  pages     = {499--513},
  year      = {1995},
  url       = {https://doi.org/10.1007/BF01192523},
  doi       = {10.1007/BF01192523},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/combinatorica/GoemansR95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dam/Goemans95,
  author    = {Michel X. Goemans},
  title     = {An Approximation Algorithm for Scheduling on Three Dedicated Machines},
  journal   = {Discrete Applied Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dam/Goemans95},
  bibsource = {dblp computer science bibliography, http://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       = {http://doi.acm.org/10.1145/227683.227684},
  doi       = {10.1145/227683.227684},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/GoemansW95},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mp/Goemans95},
  bibsource = {dblp computer science bibliography, http://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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/GoemansW95},
  bibsource = {dblp computer science bibliography, http://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},
  year      = {1995},
  crossref  = {DBLP:conf/istcs/1995},
  url       = {https://doi.org/10.1109/ISTCS.1995.377033},
  doi       = {10.1109/ISTCS.1995.377033},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/istcs/FeigeG95},
  bibsource = {dblp computer science bibliography, http://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   = {Combinatorics, Probability {\&} Computing},
  volume    = {3},
  pages     = {63--75},
  year      = {1994},
  url       = {https://doi.org/10.1017/S0963548300000985},
  doi       = {10.1017/S0963548300000985},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cpc/FurediGK94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dam/Goemans94,
  author    = {Michel X. Goemans},
  title     = {Arborescence Polytopes for Series-parallel Graphs},
  journal   = {Discrete Applied Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dam/Goemans94},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mp/Goemans94},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/orl/GoemansW94},
  bibsource = {dblp computer science bibliography, http://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. Discrete Math.},
  volume    = {7},
  number    = {4},
  pages     = {656--666},
  year      = {1994},
  url       = {https://doi.org/10.1137/S0895480192243516},
  doi       = {10.1137/S0895480192243516},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamdm/GoemansW94},
  bibsource = {dblp computer science bibliography, http://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},
  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.},
  pages     = {223--232},
  year      = {1994},
  crossref  = {DBLP:conf/soda/1994},
  url       = {http://dl.acm.org/citation.cfm?id=314464.314497},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansGPSTW94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
               23-25 January 1994, Arlington, Virginia.},
  pages     = {355--364},
  year      = {1994},
  crossref  = {DBLP:conf/soda/1994},
  url       = {http://dl.acm.org/citation.cfm?id=314464.314568},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/WilliamsonG94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoemansW94,
  author    = {Michel X. Goemans and
               David P. Williamson},
  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},
  year      = {1994},
  crossref  = {DBLP:conf/stoc/STOC26},
  url       = {http://doi.acm.org/10.1145/195058.195216},
  doi       = {10.1145/195058.195216},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GoemansW94},
  bibsource = {dblp computer science bibliography, http://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},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GoemansLS94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dm/Goemans93,
  author    = {Michel X. Goemans},
  title     = {A generalization of Petersen's theorem},
  journal   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dm/Goemans93},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mor/GoemansK93},
  bibsource = {dblp computer science bibliography, http://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    = {http://dblp.org/rec/bib/journals/mp/BienstockGSW93},
  bibsource = {dblp computer science bibliography, http://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, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mp/GoemansB93},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/networks/GoemansM93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
               Conference, Erice, Italy, April 29 - May 1, 1993},
  pages     = {57--74},
  year      = {1993},
  crossref  = {DBLP:conf/ipco/1993},
  timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GabowGW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GoemansW93,
  author    = {Michel X. Goemans and
               David P. Williamson},
  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},
  year      = {1993},
  crossref  = {DBLP:conf/ipco/1993},
  timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/GoemansW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@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 = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  pages     = {708--717},
  year      = {1993},
  crossref  = {DBLP:conf/stoc/STOC25},
  url       = {http://doi.acm.org/10.1145/167088.167268},
  doi       = {10.1145/167088.167268},
  timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/WilliamsonGMV93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Goemans92,
  author    = {Michel X. Goemans},
  title     = {Polyhedral Description of Trees and Arborescences},
  booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
               Conference, Pittsburgh, PA, May 1992},
  pages     = {1--14},
  year      = {1992},
  crossref  = {DBLP:conf/ipco/1992},
  timestamp = {Wed, 09 Oct 2002 12:11:16 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/Goemans92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansW92,
  author    = {Michel X. Goemans and
               David P. Williamson},
  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.},
  pages     = {307--316},
  year      = {1992},
  crossref  = {DBLP:conf/soda/1992},
  url       = {http://dl.acm.org/citation.cfm?id=139404.139468},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansW92},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mor/GoemansB91},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoemansB90,
  author    = {Michel X. Goemans and
               Dimitris Bertsimas},
  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.},
  pages     = {388--396},
  year      = {1990},
  crossref  = {DBLP:conf/soda/1990},
  url       = {http://dl.acm.org/citation.cfm?id=320176.320224},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/GoemansB90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/approx/2017,
  editor    = {Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               David Williamson and
               Santosh Srinivas Vempala},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
               CA, {USA}},
  series    = {LIPIcs},
  volume    = {81},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-044-6},
  isbn      = {978-3-95977-044-6},
  timestamp = {Mon, 14 Aug 2017 18:26:41 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/approx/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/2017,
  editor    = {Friedrich Eisenbrand and
               Jochen K{\"{o}}nemann},
  title     = {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},
  publisher = {Springer},
  year      = {2017},
  url       = {https://doi.org/10.1007/978-3-319-59250-3},
  doi       = {10.1007/978-3-319-59250-3},
  isbn      = {978-3-319-59249-7},
  timestamp = {Tue, 06 Jun 2017 17:32:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2014,
  editor    = {Chandra Chekuri},
  title     = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  publisher = {{SIAM}},
  year      = {2014},
  url       = {https://doi.org/10.1137/1.9781611973402},
  doi       = {10.1137/1.9781611973402},
  isbn      = {978-1-61197-338-9},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2012,
  editor    = {Howard J. Karloff and
               Toniann Pitassi},
  title     = {Proceedings of the 44th Symposium on Theory of Computing Conference,
               {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {http://dl.acm.org/citation.cfm?id=2213977},
  isbn      = {978-1-4503-1245-5},
  timestamp = {Tue, 22 May 2012 21:36:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2010,
  editor    = {Moses Charikar},
  title     = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  publisher = {{SIAM}},
  year      = {2010},
  url       = {https://doi.org/10.1137/1.9781611973075},
  doi       = {10.1137/1.9781611973075},
  isbn      = {978-0-89871-701-3},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2010},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2009,
  editor    = {Claire Mathieu},
  title     = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {https://doi.org/10.1137/1.9781611973068},
  doi       = {10.1137/1.9781611973068},
  isbn      = {978-0-89871-680-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/esa/2006,
  editor    = {Yossi Azar and
               Thomas Erlebach},
  title     = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
               September 11-13, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4168},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11841036},
  doi       = {10.1007/11841036},
  isbn      = {3-540-38875-3},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/esa/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2006,
  title     = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2006},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4031329},
  isbn      = {0-7695-2720-5},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ifipTCS/2006,
  editor    = {Gonzalo Navarro and
               Leopoldo E. Bertossi and
               Yoshiharu Kohayakawa},
  title     = {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},
  publisher = {Springer},
  year      = {2006},
  isbn      = {0-387-34633-3},
  timestamp = {Thu, 14 Aug 2008 14:44:47 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ifipTCS/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/latin/2006,
  editor    = {Jos{\'{e}} R. Correa and
               Alejandro Hevia and
               Marcos A. Kiwi},
  title     = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
               Valdivia, Chile, March 20-24, 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3887},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11682462},
  doi       = {10.1007/11682462},
  isbn      = {3-540-32755-X},
  timestamp = {Sun, 04 Jun 2017 10:09:36 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/latin/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2006,
  title     = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557},
  isbn      = {0-89871-605-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2005,
  title     = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10244},
  isbn      = {0-7695-2468-0},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2005,
  title     = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
               23-25, 2005},
  publisher = {{SIAM}},
  year      = {2005},
  url       = {http://dl.acm.org/citation.cfm?id=1070432},
  isbn      = {0-89871-585-7},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/2004,
  title     = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {2004},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9430},
  isbn      = {0-7695-2228-9},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/infocom/2004,
  title     = {Proceedings {IEEE} {INFOCOM} 2004, The 23rd Annual Joint Conference
               of the {IEEE} Computer and Communications Societies, Hong Kong, China,
               March 7-11, 2004},
  publisher = {{IEEE}},
  year      = {2004},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9369},
  isbn      = {0-7803-8355-9},
  timestamp = {Mon, 26 Jan 2015 16:54:49 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/infocom/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mobihoc/2004,
  editor    = {Jun Murai and
               Charles E. Perkins and
               Leandros Tassiulas},
  title     = {Proceedings of the 5th {ACM} Interational Symposium on Mobile Ad Hoc
               Networking and Computing, MobiHoc 2004, Roppongi Hills, Tokyo, Japan,
               May 24-26, 2004},
  publisher = {{ACM}},
  year      = {2004},
  isbn      = {1-58113-849-0},
  timestamp = {Wed, 08 Dec 2004 14:39:27 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/mobihoc/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2004,
  editor    = {J. Ian Munro},
  title     = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  publisher = {{SIAM}},
  year      = {2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792},
  isbn      = {0-89871-558-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2004,
  editor    = {L{\'{a}}szl{\'{o}} Babai},
  title     = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  publisher = {{ACM}},
  year      = {2004},
  isbn      = {1-58113-852-0},
  timestamp = {Fri, 03 Sep 2004 08:58:11 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2004},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2003,
  editor    = {Jos C. M. Baeten and
               Jan Karel Lenstra and
               Joachim Parrow and
               Gerhard J. Woeginger},
  title     = {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},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/3-540-45061-0},
  doi       = {10.1007/3-540-45061-0},
  isbn      = {3-540-40493-7},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2003},
  bibsource = {dblp computer science bibliography, http://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 = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/random/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2001,
  editor    = {Jeffrey Scott Vitter and
               Paul G. Spirakis and
               Mihalis Yannakakis},
  title     = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
               July 6-8, 2001, Heraklion, Crete, Greece},
  publisher = {{ACM}},
  year      = {2001},
  isbn      = {1-58113-349-9},
  timestamp = {Thu, 16 Feb 2012 12:04:51 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/2000,
  editor    = {David B. Shmoys},
  title     = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  publisher = {{ACM/SIAM}},
  year      = {2000},
  url       = {http://dl.acm.org/citation.cfm?id=338219},
  isbn      = {0-89871-453-2},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1999,
  editor    = {Robert Endre Tarjan and
               Tandy J. Warnow},
  title     = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               17-19 January 1999, Baltimore, Maryland},
  publisher = {{ACM/SIAM}},
  year      = {1999},
  url       = {http://dl.acm.org/citation.cfm?id=314500},
  isbn      = {0-89871-434-6},
  timestamp = {Mon, 14 Mar 2016 15:38:52 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1998,
  title     = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
               November 8-11, 1998, Palo Alto, California, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5965},
  isbn      = {0-8186-9172-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1997,
  editor    = {Michael E. Saks},
  title     = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 5-7 January 1997, New Orleans, Louisiana},
  publisher = {{ACM/SIAM}},
  year      = {1997},
  url       = {http://dl.acm.org/citation.cfm?id=314161},
  isbn      = {0-89871-390-0},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1997},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/1996,
  editor    = {Jin{-}yi Cai and
               C. K. Wong},
  title     = {Computing and Combinatorics, Second Annual International Conference,
               {COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1090},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61332-3},
  doi       = {10.1007/3-540-61332-3},
  isbn      = {3-540-61332-3},
  timestamp = {Mon, 22 May 2017 16:14:05 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/1996,
  editor    = {William H. Cunningham and
               S. Thomas McCormick and
               Maurice Queyranne},
  title     = {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},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61310-2},
  doi       = {10.1007/3-540-61310-2},
  isbn      = {3-540-61310-2},
  timestamp = {Mon, 22 May 2017 16:14:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1996,
  editor    = {{\'{E}}va Tardos},
  title     = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1996, Atlanta, Georgia},
  publisher = {{ACM/SIAM}},
  year      = {1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852},
  isbn      = {0-89871-366-8},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/swat/1996,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {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},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61422-2},
  doi       = {10.1007/3-540-61422-2},
  isbn      = {3-540-61422-2},
  timestamp = {Mon, 22 May 2017 16:14:05 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/swat/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/istcs/1995,
  title     = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3021},
  isbn      = {0-8186-6915-2},
  timestamp = {Tue, 31 May 2016 15:27:26 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/istcs/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1994,
  editor    = {Daniel Dominic Sleator},
  title     = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
               23-25 January 1994, Arlington, Virginia},
  publisher = {{ACM/SIAM}},
  year      = {1994},
  url       = {http://dl.acm.org/citation.cfm?id=314464},
  isbn      = {0-89871-329-3},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC26,
  editor    = {Frank Thomson Leighton and
               Michael T. Goodrich},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  publisher = {{ACM}},
  year      = {1994},
  isbn      = {0-89791-663-8},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC26},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/1993,
  editor    = {Giovanni Rinaldi and
               Laurence A. Wolsey},
  title     = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
               Conference, Erice, Italy, April 29 - May 1, 1993},
  publisher = {{CIACO}},
  year      = {1993},
  timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/STOC25,
  editor    = {S. Rao Kosaraju and
               David S. Johnson and
               Alok Aggarwal},
  title     = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
               Computing, May 16-18, 1993, San Diego, CA, {USA}},
  publisher = {{ACM}},
  year      = {1993},
  isbn      = {0-89791-591-7},
  timestamp = {Mon, 17 Oct 2011 15:55:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/STOC25},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/ipco/1992,
  editor    = {Egon Balas and
               G{\'{e}}rard Cornu{\'{e}}jols and
               Ravi Kannan},
  title     = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
               Conference, Pittsburgh, PA, May 1992},
  publisher = {Carnegie Mellon University},
  year      = {1992},
  timestamp = {Wed, 09 Oct 2002 12:11:16 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/ipco/1992},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1992,
  editor    = {Greg N. Frederickson},
  title     = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
               Algorithms, 27-29 January 1992, Orlando, Florida},
  publisher = {{ACM/SIAM}},
  year      = {1992},
  url       = {http://dl.acm.org/citation.cfm?id=139404},
  isbn      = {0-89791-466-X},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1992},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/soda/1990,
  editor    = {David S. Johnson},
  title     = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1990, San Francisco, California},
  publisher = {{SIAM}},
  year      = {1990},
  url       = {http://dl.acm.org/citation.cfm?id=320176},
  isbn      = {0-89871-251-3},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/soda/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier