The following pages link to Dorit S. Hochbaum (Q242829):
Displaying 50 items.
- (Q319249) (redirect page) (← links)
- Range contracts: risk sharing and beyond (Q319251) (← links)
- (Q589353) (redirect page) (← links)
- Nuclear threat detection with mobile distributed sensor networks (Q646679) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Evaluating performance of image segmentation criteria and techniques (Q743635) (← links)
- Complexity and algorithms for convex network optimization and other nonlinear problems (Q816571) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
- The inequality-satisfiability problem (Q935232) (← links)
- Dynamic evolution of economically preferred facilities (Q954890) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- The linzertorte problem, or a unified approach to painting, baking and weaving (Q1081611) (← links)
- A fast approximation algorithm for the multicovering problem (Q1082267) (← links)
- An algorithm for the detection and construction of Monge sequences (Q1116656) (← links)
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem (Q1120271) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- The multicovering problem (Q1205691) (← links)
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
- Generalized \(p\)-center problems: Complexity results and approximation algorithms (Q1278142) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632) (← links)
- Scheduling with batching: Minimizing the weighted number of tardy jobs (Q1342278) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Weighted matching with pair restrictions (Q1749789) (← links)
- Dispatch: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q1757767) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- Why should biconnected components be identified first (Q1803675) (← links)
- Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
- A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem (Q1889860) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints (Q1908017) (← links)
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine (Q1970412) (← links)
- Complexity, algorithms and applications of the integer network flow with fractional supplies problem (Q2060603) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Network flow methods for the minimum covariate imbalance problem (Q2116900) (← links)
- A unified approach for a 1D generalized total variation problem (Q2149555) (← links)
- HNCcorr: combinatorial optimization for neuron identification (Q2158640) (← links)
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) (← links)
- Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer (Q2308460) (← links)
- Isolation branching: a branch and bound algorithm for the k-terminal cut problem (Q2327144) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- A fully polynomial time approximation scheme for the replenishment storage problem (Q2661576) (← links)
