Dorit S. Hochbaum

Dorit S. Hochbaum is a professor of industrial engineering and operations research at the University of California, Berkeley. She is known for her work on approximation algorithms, particularly for facility location, covering and packing problems, and scheduling, and on flow and cut algorithms, Markov random fields, image segmentation and clustering. Provided by Wikipedia
Showing 1 - 2 results of 2 for search 'Hochbaum, Dorit', query time: 0.01s Refine Results
  1. 1
    Approximation Algorithms for NP-Hard Problems
    Published 1997
    Other Authors: “…Hochbaum, Dorit S.…”
    Book
  2. 2
    Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99,Berkeley, CA, USA, August 8-11, 1999 Pro /
    Published 1999
    Other Authors: “…Hochbaum, Dorit…”
    Full Text via HEAL-Link
    Electronic eBook
Search Tools: RSS Feed – Email Search