• Publications
  • Influence
Approximation Algorithms for NP-Hard Problems
TLDR
This book introduces unifying techniques in the analysis of approximation algorithms, intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Expand
Approximation schemes for covering and packing problems in image processing and VLSI
TLDR
The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems and how it varies with problem parameters is illustrated. Expand
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
  • D. Hochbaum, D. Shmoys
  • Computer Science, Mathematics
  • 26th Annual Symposium on Foundations of Computer…
  • 1985
TLDR
A new approach to constructing approximation algorithms, which the aim is find superoptimal, but infeasible solutions, and the performance is measured by the degree of infeasibility allowed, which should find wide applicability for any optimization problem where traditional approximation algorithms have been particularly elusive. Expand
A Best Possible Heuristic for the k-Center Problem
TLDR
A 2-approximation algorithm for the k-center problem with triangle inequality is presented, the key combinatorial object used is called a strong stable set, and the NP-completeness of the corresponding decision problem is proved. Expand
A unified approach to approximation algorithms for bottleneck problems
In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design isExpand
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
TLDR
A family of polynomial-time algorithms are given such that the last job to finish is completed as quickly as possible and the algorithm delivers a solution that is within a relative error of the optimum. Expand
An efficient algorithm for Co-segmentation
  • D. Hochbaum, Vikas Singh
  • Mathematics, Computer Science
  • IEEE 12th International Conference on Computer…
  • 1 September 2009
TLDR
The model proposed here bypasses measurement of the histogram differences in a direct fashion and enables obtaining efficient solutions to the underlying optimization model, and can be solved to optimality in polynomial time using a maximum flow procedure on an appropriately constructed graph. Expand
Heuristics for the fixed cost median problem
  • D. Hochbaum
  • Mathematics, Computer Science
  • Math. Program.
  • 1 December 1982
We describe in this paper polynomial heuristics for three important hard problems—the discrete fixed cost median problem (the plant location problem), the continuous fixed cost median problem in aExpand
Efficient bounds for the stable set, vertex cover and set packing problems
  • D. Hochbaum
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1 September 1983
TLDR
A collection of efficient algorithms that deliver approximate solution to the weighted stable set, vertex cover and set packing problems and guarantee bounds on the ratio of the heuristic Solution to the optimal solution. Expand
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality
TLDR
An algorithm for solving feasibility in linear programs with up to two variables per inequality which is derived directly from the Fourier--Motzkin elimination method is presented, showing that both a feasible solution and an optimal solution with respect to an arbitrary objective function can be computed in pseudo-polynomial time. Expand
...
1
2
3
4
5
...