dorit-s-hochbaum documents

Analysis of the greedy approach in problems of maximum k-coverage
Documents Analysis of the greedy approach in problems of maximum k-coverage
Minimax problems with bitonic matrices
Documents Minimax problems with bitonic matrices
A new—old algorithm for minimum-cut and maximum-flow in closure graphs
Documents A new—old algorithm for minimum-cut and maximum-flow in closure graphs
Analysis of a flow problem with fixed charges
Documents Analysis of a flow problem with fixed charges
Approximation Algorithms for Network Design Problems on Bounded Subsets
Documents Approximation Algorithms for Network Design Problems on Bounded Subsets
Approximating Clique and Biclique Problems
Documents Approximating Clique and Biclique Problems
Efficient bounds for the stable set, vertex cover and set packing problems
Documents Efficient bounds for the stable set, vertex cover and set packing problems
The Linzertorte problem, or a unified approach to painting, baking and weaving
Documents The Linzertorte problem, or a unified approach to painting, baking and weaving
Why should biconnected components be identified first
Documents Why should biconnected components be identified first
A better than “best possible” algorithm to edge color multigraphs
Documents A better than “best possible” algorithm to edge color multigraphs
Fast approximation algorithms for a nonconvex covering problem
Documents Fast approximation algorithms for a nonconvex covering problem
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Documents Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
The inequality-satisfiability problem
Documents The inequality-satisfiability problem
Scheduling with batching: two job types
Documents Scheduling with batching: two job types
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Documents A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
Documents Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
Generalized p-Center problems: Complexity results and approximation algorithms
Documents Generalized p-Center problems: Complexity results and approximation algorithms
How to allocate review tasks for robust ranking
Documents How to allocate review tasks for robust ranking
Complexity and algorithms for convex network optimization and other nonlinear problems
Documents Complexity and algorithms for convex network optimization and other nonlinear problems
Dynamic evolution of economically preferred facilities
Documents Dynamic evolution of economically preferred facilities
Simplifications and speedups of the pseudoflow algorithm
Documents Simplifications and speedups of the pseudoflow algorithm