The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
David P. Williamson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David B. Shmoys, Joel Wein, David P. Williamson
    Scheduling Parallel Machines On-Line. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1313-1331 [Journal]
  2. Lisa Fleischer, Kamal Jain, David P. Williamson
    An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:339-347 [Conf]
  3. David B. Shmoys, Joel Wein, David P. Williamson
    Scheduling Parallel Machines On-Line [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:131-140 [Conf]
  4. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson
    Gadgets, Approximation, and Linear Programming (extended abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:617-626 [Conf]
  5. Fabián A. Chudak, Tim Roughgarden, David P. Williamson
    Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:60-70 [Conf]
  6. Fabián A. Chudak, David P. Williamson
    Improved Approximation Algorithms for Capacitated Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:99-113 [Conf]
  7. 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]
  8. 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]
  9. Michel X. Goemans, David P. Williamson
    Primal-Dual Approximation Algorithms for Feedback Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:147-161 [Conf]
  10. Paat Rusmevichientong, David P. Williamson
    An adaptive algorithm for selecting profitable keywords for search-based advertising services. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:260-269 [Conf]
  11. Aaron Archer, David P. Williamson
    Faster approximation algorithms for the minimum latency problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:88-96 [Conf]
  12. Takao Asano, David P. Williamson
    Improved approximation algorithms for MAX SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:96-105 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
    A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:484-489 [Conf]
  18. Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson
    A general approach for incremental approximation and hierarchical clustering. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1147-1156 [Conf]
  19. R. Ravi, David P. Williamson
    Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:1000-1001 [Conf]
  20. Mateo Restrepo, David P. Williamson
    A simple GAP-canceling algorithm for the generalized maximum flow problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:534-543 [Conf]
  21. 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]
  22. Alok Aggarwal, Jon M. Kleinberg, David P. Williamson
    Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:585-594 [Conf]
  23. Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
    Adversarial Queueing Theory. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:376-385 [Conf]
  24. 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]
  25. 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]
  26. Sanjeev Khanna, Madhu Sudan, David P. Williamson
    A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:11-20 [Conf]
  27. 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]
  28. David P. Williamson
    Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:1- [Conf]
  29. Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmine Novak, D. Sivakumar, John A. Tomlin, David P. Williamson
    Searching the workplace web. [Citation Graph (0, 0)][DBLP]
    WWW, 2003, pp:366-375 [Conf]
  30. R. Ravi, David P. Williamson
    Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:98-107 [Journal]
  31. R. Ravi, David P. Williamson
    An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:21-43 [Journal]
  32. 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]
  33. 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]
  34. Monika Rauch Henzinger, David P. Williamson
    On the Number of Small Cuts in a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:41-44 [Journal]
  35. David B. Shmoys, David P. Williamson
    Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:6, pp:281-285 [Journal]
  36. Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
    Adversarial queuing theory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:1, pp:13-38 [Journal]
  37. 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]
  38. Takao Asano, David P. Williamson
    Improved Approximation Algorithms for MAX SAT. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:173-202 [Journal]
  39. Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson
    A primal-dual schema based approximation algorithm for the element connectivity problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:45, n:1, pp:1-15 [Journal]
  40. Lisa Fleischer, Kamal Jain, David P. Williamson
    Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:5, pp:838-867 [Journal]
  41. 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]
  42. 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]
  43. Fabián A. Chudak, Tim Roughgarden, David P. Williamson
    Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:100, n:2, pp:411-421 [Journal]
  44. Fabián A. Chudak, David P. Williamson
    Improved approximation algorithms for capacitated facility location problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:2, pp:207-222 [Journal]
  45. 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]
  46. 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]
  47. 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]
  48. Alok Aggarwal, Jon M. Kleinberg, David P. Williamson
    Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1321-1333 [Journal]
  49. 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]
  50. Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson
    The Approximability of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1863-1920 [Journal]
  51. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson
    Gadgets, Approximation, and Linear Programming. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:6, pp:2074-2097 [Journal]
  52. 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]
  53. 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]
  54. R. N. Uma, Joel Wein, David P. Williamson
    On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:241-256 [Journal]
  55. Yogeshwer Sharma, David P. Williamson
    Stackelberg thresholds in network routing games or the value of altruism. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:93-102 [Conf]
  56. Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson
    Approximation algorithms for prize collecting forest problems with submodular penalty functions. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1275-1284 [Conf]
  57. Anke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson
    Deterministic pivoting algorithms for constrained ranking and clustering problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:405-414 [Conf]

  58. Offline and Online Facility Leasing. [Citation Graph (, )][DBLP]


  59. Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems. [Citation Graph (, )][DBLP]


  60. Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. [Citation Graph (, )][DBLP]


Search in 0.004secs, 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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002