The following pages link to Clifford Stein (Q910242):
Displaying 50 items.
- A parallel algorithm for eliminating cycles in undirected graphs (Q910243) (← links)
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
- (Q1041339) (redirect page) (← links)
- Bounded-space online bin cover (Q1041340) (← links)
- Approximating the minimum-cost maximum flow is P-complete (Q1198087) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- Approximating disjoint-path problems using packing integer programs (Q1424288) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- Distributed algorithms for matching in hypergraphs (Q2117684) (← links)
- A competitive algorithm for throughput maximization on identical machines (Q2164724) (← links)
- The online set aggregation problem (Q2294691) (← links)
- Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis (Q2362358) (← links)
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
- (Q2747613) (← links)
- Approximation Algorithms for Single-Source Unsplittable Flow (Q2784488) (← links)
- Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596) (← links)
- (Q2865939) (← links)
- (Q2921701) (← links)
- (Q2921743) (← links)
- On distributing symmetric streaming computations (Q2930348) (← links)
- Online scheduling of packets with agreeable deadlines (Q2933633) (← links)
- (Q2934598) (← links)
- (Q2934667) (← links)
- Approximating Semidefinite Packing Programs (Q3004983) (← links)
- (Q3046476) (← links)
- (Q3066732) (← links)
- (Q3138949) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- LP Decoding Corrects a Constant Fraction of Errors (Q3548232) (← links)
- Feasible and Accurate Algorithms for Covering Semidefinite Programs (Q3569887) (← links)
- Divide-and-Conquer Approximation Algorithm for Vertex Cover (Q3583300) (← links)
- Speed Scaling for Weighted Flow Time (Q3586181) (← links)
- Online Stochastic Packing Applied to Display Ad Allocation (Q3586461) (← links)
- How to Schedule When You Have to Buy Your Energy (Q3588420) (← links)
- Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring (Q3596346) (← links)
- (Q3619797) (← links)
- (Q3619798) (← links)
- (Q3619846) (← links)
- (Q3651735) (← links)
- (Q3840354) (← links)
- (Q3840370) (← links)
- Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time (Q4216148) (← links)
- (Q4252370) (← links)
