The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dorit S. Hochbaum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marshall L. Fisher, Dorit S. Hochbaum
    Database Location in Computer Networks. [Citation Graph (7, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:718-735 [Journal]
  2. Dorit S. Hochbaum
    Approximation Algorithms for the Set Covering and Vertex Cover Problems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:555-556 [Journal]
  3. Dorit S. Hochbaum
    Instant recognition of polynominal time solvability, half integrality and 2-approximations. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:2-14 [Conf]
  4. Dorit S. Hochbaum
    Instant Recognition of Half Integrality and 2-Approximations. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:99-110 [Conf]
  5. Dorit S. Hochbaum
    The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:111-122 [Conf]
  6. Dorit S. Hochbaum, Maurice Queyranne
    Minimizing a Convex Cost Closure Set. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:256-267 [Conf]
  7. Olivier Goldschmidt, Dorit S. Hochbaum
    Polynomial Algorithm for the k-Cut Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:444-451 [Conf]
  8. Dorit S. Hochbaum, David B. Shmoys
    Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:79-89 [Conf]
  9. Dorit S. Hochbaum, David B. Shmoys
    A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:382-393 [Conf]
  10. Dorit S. Hochbaum, J. George Shanthikumar
    The Complexity of Nonlinear Separable Optimization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:461-472 [Conf]
  11. Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    Solving the Convex Cost Integer Dual Network Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:31-44 [Conf]
  12. Dorit S. Hochbaum
    On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its Extensions. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:261-273 [Conf]
  13. Dorit S. Hochbaum
    The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:325-337 [Conf]
  14. Dorit S. Hochbaum, Joseph Naor
    Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:44-59 [Conf]
  15. Dorit S. Hochbaum, Wolfgang Maass
    Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:55-62 [Conf]
  16. Dorit S. Hochbaum, David B. Shmoys
    Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:324-333 [Conf]
  17. Dorit S. Hochbaum, Asaf Levin
    The k-Allocation Problem and Its Variants. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:253-264 [Conf]
  18. Dorit S. Hochbaum
    Ranking Sports Teams and the Inverse Equal Paths Problem. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:307-318 [Conf]
  19. Dorit S. Hochbaum
    Complexity and algorithms for convex network optimization and other nonlinear problems. [Citation Graph (0, 0)][DBLP]
    4OR, 2005, v:3, n:3, pp:171-216 [Journal]
  20. Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
    A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:3, pp:189-208 [Journal]
  21. Naveen Garg, Dorit S. Hochbaum
    An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:111-121 [Journal]
  22. Olivier Goldschmidt, Dorit S. Hochbaum
    k-edge Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:2, pp:159-169 [Journal]
  23. Dorit S. Hochbaum
    Why Should Biconnected Components be Identified First. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:203-210 [Journal]
  24. Dorit S. Hochbaum, Dan Landy
    Scheduling with Batching: Two Job Types. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:99-114 [Journal]
  25. Dorit S. Hochbaum, Anu Pathria
    Approximating a generalization of MAX 2SAT and MIN 2SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:107, n:1-3, pp:41-59 [Journal]
  26. Dorit S. Hochbaum, Eli V. Olinick
    The Bounded Cycle-Cover Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2001, v:13, n:2, pp:104-119 [Journal]
  27. Olivier Goldschmidt, Dorit S. Hochbaum, Gang Yu
    A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:6, pp:305-310 [Journal]
  28. Dorit S. Hochbaum, Ron Shamir
    An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:4, pp:215-219 [Journal]
  29. Dorit S. Hochbaum
    An efficient algorithm for image segmentation, Markov random fields and related problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:4, pp:686-701 [Journal]
  30. Dorit S. Hochbaum, Wolfgang Maass
    Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:1, pp:130-136 [Journal]
  31. Dorit S. Hochbaum, David B. Shmoys
    A unified approach to approximation algorithms for bottleneck problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:533-550 [Journal]
  32. Dorit S. Hochbaum, David B. Shmoys
    Using dual approximation algorithms for scheduling problems theoretical and practical results. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:144-162 [Journal]
  33. Dorit S. Hochbaum, J. George Shanthikumar
    Convex Separable Optimization Is Not Much Harder than Linear Optimization [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:4, pp:843-862 [Journal]
  34. Dorit S. Hochbaum
    Approximating Clique and Biclique Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:174-200 [Journal]
  35. Dorit S. Hochbaum, Wolfgang Maass
    Fast Approximation Algorithms for a Nonconvex Covering Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:3, pp:305-323 [Journal]
  36. Dorit S. Hochbaum, Joseph Naor
    Approximation Algorithms for Network Design Problems on Bounded Subsets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:403-414 [Journal]
  37. Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys
    A Better than "Best Possible" Algorithm to Edge Color Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:79-104 [Journal]
  38. Dorit S. Hochbaum, Anu Pathria
    Path Costs in Evolutionary Tree Reconstruction. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:2, pp:163-176 [Journal]
  39. Dorit S. Hochbaum, Sung-Pil Hong
    About strongly polynomial time algorithms for quadratic optimization over submodular constraints. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:69, n:, pp:269-309 [Journal]
  40. Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir
    Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:69-83 [Journal]
  41. Dorit S. Hochbaum, Ron Shamir, J. George Shanthikumar
    A polynomial algorithm for an integer quadratic non-separable transportation problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:55, n:, pp:359-371 [Journal]
  42. Dorit S. Hochbaum
    A new - old algorithm for minimum-cut and maximum-flow in closure graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:4, pp:171-193 [Journal]
  43. Dorit S. Hochbaum, Anu Pathria
    The bottleneck graph partition problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:4, pp:221-225 [Journal]
  44. Dorit S. Hochbaum, Paul A. Tucker
    Minimax problems with bitonic matrices. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:3, pp:113-124 [Journal]
  45. Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
    The SONET edge-partition problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:1, pp:13-23 [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. Fabián A. Chudak, Dorit S. Hochbaum
    A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:25, n:5, pp:199-204 [Journal]
  48. Dorit S. Hochbaum
    Monotonizing linear programs with up to two nonzeroes per column. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:49-58 [Journal]
  49. Dorit S. Hochbaum, Gerhard J. Woeginger
    A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:25-28 [Journal]
  50. Dorit S. Hochbaum, Joseph Naor
    Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1179-1192 [Journal]
  51. Dorit S. Hochbaum, David B. Shmoys
    A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:539-551 [Journal]
  52. Olivier Goldschmidt, Dorit S. Hochbaum
    A Fast Perfect-Matching Algorithm in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:48-57 [Journal]
  53. Olivier Goldschmidt, Dorit S. Hochbaum
    Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:58-73 [Journal]
  54. Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu
    Approximation Algorithms for the k-Clique Covering Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:3, pp:492-509 [Journal]
  55. Dorit S. Hochbaum, Maurice Queyranne
    Minimizing a Convex Cost Closure Set. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:192-207 [Journal]
  56. Dorit S. Hochbaum
    An optimal test compression procedure for combinational circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1996, v:15, n:10, pp:1294-1299 [Journal]

  57. An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane. [Citation Graph (, )][DBLP]


  58. Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. [Citation Graph (, )][DBLP]


  59. An Efficient and Effective Image Segmentation Interactive Tool. [Citation Graph (, )][DBLP]


  60. Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions [Citation Graph (, )][DBLP]


  61. Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems [Citation Graph (, )][DBLP]


  62. Minimizing the number of tardy job units under release time constraints. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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