Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Stein, Clifford - Department of Industrial Engineering and Operations Research, Columbia University
Minimizing Average Completion Time in the Presence of Release Dates
Scheduling Algorithms David Karger, Massachusetts Institute of Technology
On the Existence of Schedules that are NearOptimal for both Makespan and Total Weighted Completion Time
Improved Scheduling Algorithms for Minsum Criteria (Extended Abstract)
Improved Approximation Algorithms for Shop Scheduling Problems \Lambda
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
IMPROVED ALGORITHMS FOR BIPARTITE NETWORK FLOW RAVINDRA K. AHUJA \Lambda , JAMES B. ORLIN y , CLIFFORD STEIN z , AND ROBERT E.
Submitted, Journal of Computational Biology. Reducing Mass Degeneracy in SAR by MS
A New Approach to the Minimum Cut Problem David R. Karger \Lambda
Short Superstrings and the Structure of Overlapping Chris Armen \Lambda Clifford Stein y
Long Tours and Short Superstrings (extended abstract)
Approximating the MinimumCost Maximum Flow is Clifford Stein \Lambda
Approximation Techniques for Average Completion Time Scheduling C. Chekuri \Lambda
Parallel Algorithms for the Assignment and MinimumCost Flow Problems
Optimal Time-Critical Scheduling Via Resource Augmentation Cynthia A. Phillips y Cli Stein z Eric Torng x Joel Wein {
Distributed Job Scheduling in Rings Perry Fizzano ?
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems
Using Cycles and Scaling Parallel Algorithms
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
3 Superstring Approximation Algorithm Chris Armen \Lambda
Experimental Study of Minimum Cut Algorithms Chandra S. Chekuri \Lambda
Fast Approximation Algorithms for Multicommodity Flow Problems \Lambda
Task Scheduling in Networks \Lambda Cynthia Phillips y
A new approach to clustering Javed Aslam ? , Alain Leblanc ?? , Cli ord Stein ? ? ?
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts