Travelled to:1 × Canada
1 × Italy
1 × USA
Collaborated with:N.Garg J.G.Shanthikumar D.B.Shmoys
Talks about:approxim (2) problem (2) power (2) bottleneck (1) nonlinear (1) algorithm (1) techniqu (1) minimum (1) complex (1) separ (1)
Person: Dorit S. Hochbaum
DBLP: Hochbaum:Dorit_S=
Contributed to:
1994
19891984Wrote 3 papers:
- STOC-1994-GargH #algorithm #approximate #problem
- An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane (NG, DSH), pp. 432–438.
- ICALP-1989-HochbaumS #complexity #optimisation
- The Complexity of Nonlinear Separable Optimization (DSH, JGS), pp. 461–472.
- STOC-1984-HochbaumS #approximate #graph #problem
- Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems (DSH, DBS), pp. 324–333.