The following pages link to Howard J. Karloff (Q1117702):
Displaying 50 items.
- (Q294792) (redirect page) (← links)
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut (Q294793) (← links)
- Sequential dependency computation via geometric data structures (Q390107) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- Scheduling to minimize staleness and stretch in real-time data warehouses (Q693761) (← links)
- (Q757046) (redirect page) (← links)
- Connectivity vs. reachability (Q757048) (← links)
- Lower bounds for linear locally decodable codes and private information retrieval (Q862344) (← links)
- New algorithms for an ancient scheduling problem. (Q960514) (← links)
- On the integrality ratio for tree augmentation (Q1003482) (← links)
- (Q1103636) (redirect page) (← links)
- A Las Vegas RNC algorithm for maximum matching (Q1103637) (← links)
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques (Q1117703) (← links)
- The iterated mod problem (Q1119390) (← links)
- An NC algorithm for Brooks' theorem (Q1124351) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- Fast algorithms for approximately counting mismatches (Q1313761) (← links)
- A better lower bound for on-line scheduling (Q1327292) (← links)
- On construction of \(k\)-wise independent random variables (Q1375059) (← links)
- A new approximation algorithm for finding heavy planar subgraphs (Q1400892) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Linear programming. (Q2380106) (← links)
- Approximating directed multicuts (Q2387182) (← links)
- A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems (Q2706128) (← links)
- (Q2768266) (← links)
- On construction of <i>k</i>-wise independent random variables (Q2817651) (← links)
- On earthmover distance, metric labeling, and 0-extension (Q2931417) (← links)
- (Q2934701) (← links)
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP (Q3020008) (← links)
- (Q3113698) (← links)
- (Q3138905) (← links)
- Randomized algorithms and pseudorandom numbers (Q3140013) (← links)
- An improved approximation algorithm for resource allocation (Q3189033) (← links)
- SEPARATING POINTS BY AXIS-PARALLEL LINES (Q3373055) (← links)
- On Earthmover Distance, Metric Labeling, and 0-Extension (Q3558006) (← links)
- On the fractal behavior of TCP (Q3581247) (← links)
- OPT versus LOAD in dynamic storage allocation (Q3581277) (← links)
- Improved Approximation Algorithms for Label Cover Problems (Q3639232) (← links)
- Coloring planar graphs in parallel (Q3776654) (← links)
- Efficient parallel algorithms for edge coloring problems (Q3783599) (← links)
- (Q4000282) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139) (← links)
- (Q4228497) (← links)
- (Q4230341) (← links)
- New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem (Q4268854) (← links)
- How Good is the Goemans--Williamson MAX CUT Algorithm? (Q4268884) (← links)
- Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms (Q4291558) (← links)
- Algebraic methods for interactive proof systems (Q4302792) (← links)
- (Q4335205) (← links)