The following pages link to Dorit S. Hochbaum (Q242829):
Displaying 50 items.
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs. (Q2744651) (← links)
- (Q2753721) (← links)
- (Q2753941) (← links)
- An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q2817634) (← links)
- Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization (Q2860122) (← links)
- Experimental analysis of the MRF algorithm for segmentation of noisy medical images (Q2865871) (← links)
- Rating customers according to their promptness to adopt new products (Q2879513) (← links)
- The bounded cycle-cover problem (Q2884498) (← links)
- Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems (Q2933649) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- Capacity Acquisition, Subcontracting, and Lot Sizing (Q3114717) (← links)
- Solving the Convex Cost Integer Dual Network Flow Problem (Q3114859) (← links)
- Algorithms and complexity of range clustering (Q3120783) (← links)
- (Q3221406) (← links)
- A Fast Perfect-Matching Algorithm in Random Graphs (Q3360222) (← links)
- TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time (Q3392169) (← links)
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem (Q3392224) (← links)
- Optimizing over Consecutive 1's and Circular 1's Constraints (Q3440211) (← links)
- Country credit-risk rating aggregation via the separation-deviation model† (Q3605199) (← links)
- Efficient Algorithms for the Inverse Spanning-Tree Problem (Q3637389) (← links)
- On the Fractional Solution to the Set Covering Problem (Q3668305) (← links)
- (Q3675519) (← links)
- A Best Possible Heuristic for the <i>k</i>-Center Problem (Q3680584) (← links)
- An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem (Q3689216) (← links)
- A Packing Problem You Can Almost Solve by Sitting on Your Suitcase (Q3718472) (← links)
- A better than “best possible” algorithm to edge color multigraphs (Q3725544) (← links)
- (Q3761689) (← links)
- OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing (Q3767269) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- Fast approximation algorithms for a nonconvex covering problem (Q3776651) (← links)
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach (Q3792237) (← links)
- (Q3815886) (← links)
- (Q3824076) (← links)
- Analysis of a flow problem with fixed charges (Q3827774) (← links)
- (Q3840369) (← links)
- Probabilistic Analysis of the Planar <i>k</i>-Median Problem (Q3875687) (← links)
- Database Location in Computer Networks (Q3890141) (← links)
- Heuristics for the fixed cost median problem (Q3929508) (← links)
- Approximation Algorithms for the Set Covering and Vertex Cover Problems (Q3947140) (← links)
- Steinhaus's geometric location problem for random samples in the plane (Q3966854) (← links)
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518) (← links)
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs (Q4015475) (← links)
- Approximating Clique and Biclique Problems (Q4217307) (← links)
- Analysis of the greedy approach in problems of maximum \(k\)-coverage (Q4255028) (← links)
- (Q4263700) (← links)
- A Polynomial Algorithm for the k-cut Problem for Fixed k (Q4294727) (← links)
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732) (← links)
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems (Q4302594) (← links)
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality (Q4327416) (← links)
- The bottleneck graph partition problem (Q4344458) (← links)
