The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michel X. Goemans: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Improved Bounds for On-line Load Balancing. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:1-10 [Conf]
  2. Brian C. Dean, Michel X. Goemans, Nicole Immorlica
    Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:268-279 [Conf]
  3. Moses Charikar, Michel X. Goemans, Howard J. Karloff
    On the Integrality Ratio for Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:101-107 [Conf]
  4. Brian C. Dean, Michel X. Goemans, Jan Vondrák
    Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:208-217 [Conf]
  5. Yefim Dinitz, Naveen Garg, Michel X. Goemans
    On the Single-Source Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:290-299 [Conf]
  6. Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta
    Sink Equilibria and Convergence. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:142-154 [Conf]
  7. Michel X. Goemans
    Minimum Bounded Degree Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:273-282 [Conf]
  8. Brian C. Dean, Michel X. Goemans
    Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1138-1152 [Conf]
  9. Michael Rosenblum, Michel X. Goemans, Vahid Tarokh
    Universal Bounds on Buffer Size for Packetizing Fluid Policies in Input Queued, Crossbar Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  10. Harold N. Gabow, Michel X. Goemans, David P. Williamson
    An efficient approximation algorithm for the survivable network design problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:57-74 [Conf]
  11. Michel X. Goemans
    Polyhedral Description of Trees and Arborescences. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:1-14 [Conf]
  12. Michel X. Goemans
    A Supermodular Relaxation for Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:288-300 [Conf]
  13. Michel X. Goemans, Leslie A. Hall
    The Strongest Facets of the Acyclic Subgraph Polytope Are Unknown. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:415-429 [Conf]
  14. Michel X. Goemans, David P. Williamson
    A new \frac34-approximation algorithm for MAX SAT. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:313-321 [Conf]
  15. Michel X. Goemans, David P. Williamson
    Primal-Dual Approximation Algorithms for Feedback Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:147-161 [Conf]
  16. Uriel Feige, Michel X. Goemans
    Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:182-189 [Conf]
  17. Michel X. Goemans, Jan Vondrák
    Stochastic Covering and Adaptivity. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:532-543 [Conf]
  18. Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, Marina Thottan
    Market sharing games applied to content distribution in ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2004, pp:55-66 [Conf]
  19. Michel X. Goemans
    Using Complex Semidefinite Programming for Approximating MAX E2-LIN3. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:1- [Conf]
  20. Brian C. Dean, Michel X. Goemans, Jan Vondrák
    Adaptivity and approximation for stochastic packing problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:395-404 [Conf]
  21. Lisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko
    Tight approximation algorithms for maximum general assignment problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:611-620 [Conf]
  22. Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
    Approximating the smallest k-edge connected spanning subgraph by LP-rounding. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:562-571 [Conf]
  23. Michel X. Goemans
    Improved Approximation Algorithms for Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:591-598 [Conf]
  24. Michel X. Goemans, Dimitris Bertsimas
    On the Parsimonious Property of Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:388-396 [Conf]
  25. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
    Improved Approximation Algorithms for Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:223-232 [Conf]
  26. Michel X. Goemans, Jon M. Kleinberg
    An Improved Approximation Ratio for the Minimum Latency Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:152-158 [Conf]
  27. Michel X. Goemans, Martin Skutella
    Cooperative facility location games. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:76-85 [Conf]
  28. Michel X. Goemans, Jan Vondrák
    Covering minimum spanning trees of random subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:934-941 [Conf]
  29. Michel X. Goemans, David P. Williamson
    A General Approximation Technique for Constrained Forest Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:307-316 [Conf]
  30. Michel X. Goemans, David P. Williamson
    Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:366-375 [Conf]
  31. Jean-François Macq, Michel X. Goemans
    Trade-offs on the location of the core node in a network. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:597-604 [Conf]
  32. David P. Williamson, Michel X. Goemans
    Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:355-364 [Conf]
  33. José R. Correa, Michel X. Goemans
    An approximate König's theorem for edge-coloring weighted bipartite graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:398-406 [Conf]
  34. Michel X. Goemans, David P. Williamson
    Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:443-452 [Conf]
  35. Michel X. Goemans, David P. Williamson
    .879-approximation algorithms for MAX CUT and MAX 2SAT. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:422-431 [Conf]
  36. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
    A primal-dual approximation algorithm for generalized Steiner network problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:708-717 [Conf]
  37. R. Ravi, Michel X. Goemans
    The Constrained Minimum Spanning Tree Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:66-75 [Conf]
  38. Matthew Andrews, Michel X. Goemans, Lisa Zhang
    Improved Bounds for On-Line Load Balancing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:4, pp:278-301 [Journal]
  39. Yefim Dinitz, Naveen Garg, Michel X. Goemans
    On the Single-Source Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:1, pp:17-41 [Journal]
  40. Michel X. Goemans, V. S. Ramakrishnan
    Minimizing Submodular Functions over Families of Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:4, pp:499-513 [Journal]
  41. Michel X. Goemans, David P. Williamson
    Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:37-59 [Journal]
  42. David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani
    A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:3, pp:435-454 [Journal]
  43. Michel X. Goemans, Franz Rendl
    Semidefinite Programs and Association Schemes. [Citation Graph (0, 0)][DBLP]
    Computing, 1999, v:63, n:4, pp:331-340 [Journal]
  44. Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman
    On the Maximum Number of Triangles in Wheel-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:63-75 [Journal]
  45. Michel X. Goemans
    Arborescence Polytopes for Series-parallel Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:3, pp:277-289 [Journal]
  46. Michel X. Goemans
    An Approximation Algorithm for Scheduling on Three Dedicated Machines. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:61, n:1, pp:49-59 [Journal]
  47. Michel X. Goemans, David P. Williamson
    Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1115-1145 [Journal]
  48. Michel X. Goemans, Martin Skutella
    Cooperative facility location games. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:194-214 [Journal]
  49. Michel X. Goemans, David P. Williamson
    Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:442-470 [Journal]
  50. Michel X. Goemans, Levent Tunçel
    When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2001, v:26, n:4, pp:796-815 [Journal]
  51. Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, David P. Williamson
    A note on the prize collecting traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:413-420 [Journal]
  52. Harold N. Gabow, Michel X. Goemans, David P. Williamson
    An efficient approximation algorithm for the survivable network design problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:13-40 [Journal]
  53. Michel X. Goemans
    The Steiner tree polytope and related polyhedra. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:63, n:, pp:157-182 [Journal]
  54. Michel X. Goemans
    Worst-case comparison of valid inequalities for the TSP. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:69, n:, pp:335-349 [Journal]
  55. Michel X. Goemans
    Semidefinite programming in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:143-161 [Journal]
  56. Michel X. Goemans, Dimitris Bertsimas
    Survivable networks, linear programming relaxations and the parsimonious property. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:145-166 [Journal]
  57. Michel X. Goemans, Jon M. Kleinberg
    An improved approximation ratio for the minimum latency problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:111-124 [Journal]
  58. Jean-François Macq, Michel X. Goemans
    Trade-offs on the location of the core node in a network. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:3, pp:179-186 [Journal]
  59. Fabián A. Chudak, Michel X. Goemans, Dorit S. Hochbaum, David P. Williamson
    A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:4-5, pp:111-118 [Journal]
  60. Michel X. Goemans, Joel Wein, David P. Williamson
    A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:4, pp:149-154 [Journal]
  61. Michel X. Goemans, Jan Vondrák
    Covering minimum spanning trees of random subgraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:3, pp:257-276 [Journal]
  62. Michel X. Goemans, David P. Williamson
    A General Approximation Technique for Constrained Forest Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:296-317 [Journal]
  63. Michel X. Goemans
    Approximate Edge Splitting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:138-141 [Journal]
  64. Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang
    Single Machine Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:165-192 [Journal]
  65. Michel X. Goemans, David P. Williamson
    Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:281-294 [Journal]
  66. Michel X. Goemans, David P. Williamson
    New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:4, pp:656-666 [Journal]
  67. Jon M. Kleinberg, Michel X. Goemans
    The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:2, pp:196-204 [Journal]
  68. Michael Rosenblum, Constantine Caramanis, Michel X. Goemans, Vahid Tarokh
    Approximating fluid schedules in crossbar packet-switches and Banyan networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:16, n:6, pp:1374-1387 [Journal]
  69. Michel X. Goemans
    A generalization of Petersen's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:277-282 [Journal]
  70. José R. Correa, Michel X. Goemans
    Improved Bounds on Nonblocking 3-Stage Clos Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:870-894 [Journal]

  71. The Unsplittable Stable Marriage Problem. [Citation Graph (, )][DBLP]


  72. Approximating submodular functions everywhere. [Citation Graph (, )][DBLP]


  73. An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  74. A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem [Citation Graph (, )][DBLP]


  75. Combining Approximation Algorithms for the Prize-Collecting TSP [Citation Graph (, )][DBLP]


  76. Symmetric Submodular Function Minimization Under Hereditary Family Constraints [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002