Clifford Stein

According to our database, Clifford Stein authored at least 147 papers between 1990 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

A competitive algorithm for throughput maximization on identical machines.

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou

Math. Program., July, 2024

Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing.

Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein

SIAM J. Comput., 2024

Polylog-Competitive Deterministic Local Routing and Scheduling.

Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory.

Yuri Faenza, Cliff Stein, Jia Wan

Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Drawing Competitive Districts in Redistricting.

Gabriel Chuang, Oussama Hanguir, Clifford Stein

Proceedings of the 5th Symposium on Foundations of Responsible Computing, 2024

2023

A randomized algorithm for online metric b-matching.

Bala Kalyanasundaram, Kirk Pruhs, Clifford Stein

Oper. Res. Lett., November, 2023

Learning-Augmented Online Packet Scheduling with Deadlines.

Clifford Stein, Hao-Ting Wei

CoRR, 2023

Scheduling with Speed Predictions.

Eric Balkanski, Tingting Ou, Clifford Stein, Hao-Ting Wei

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Energy-Efficient Scheduling with Predictions.

Eric Balkanski, Noémie Périvier, Clifford Stein, Hao-Ting Wei

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity.

Yuri Faenza, Clifford Stein, Jia Wan

CoRR, 2022

Estimating the Longest Increasing Subsequence in Nearly Optimal Time.

Alexandr Andoni, Negev Shekel Nosatzki, Sandip Sinha, Clifford Stein

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

A Competitive Algorithm for Throughout Maximization on Identical Machines.

Benjamin Moseley, Kirk Pruhs, Clifford Stein, Rudy Zhou

CoRR, 2021

Incremental Edge Orientation in Forests.

Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Matching Drivers to Riders: A Two-Stage Robust Approach.

Omar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein

Proceedings of the Approximation, 2021

2020

Scheduling When You Do Not Know the Number of Machines.

Clifford Stein, Mingxian Zhong

ACM Trans. Algorithms, 2020

Hallucination Helps: Energy Efficient Virtual Circuit Routing.

Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein

SIAM J. Comput., 2020

A general framework for handling commitment in online throughput maximization.

Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein

Math. Program., 2020

Advance Service Reservations with Heterogeneous Customers.

Clifford Stein, Van-Anh Truong, Xinshang Wang

Manag. Sci., 2020

Distributed Algorithms for Matching in Hypergraphs.

Oussama Hanguir, Clifford Stein

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Parallel approximate undirected shortest paths via low hop emulators.

Alexandr Andoni, Clifford Stein, Peilin Zhong

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

MapReduce Meets Fine-Grained Complexity: MapReduce Algorithms for APSP, Matrix Multiplication, 3-SUM, and Beyond.

MohammadTaghi Hajiaghayi, Silvio Lattanzi, Saeed Seddighin, Cliff Stein

CoRR, 2019

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs.

Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Submodular Secretary Problem with Shortlists.

Shipra Agrawal, Mohammad Shadravan, Cliff Stein

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity.

Alexandr Andoni, Clifford Stein, Peilin Zhong

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Resource cost aware scheduling.

Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein

Eur. J. Oper. Res., 2018

Scheduling (Dagstuhl Seminar 18101).

Magnús M. Halldórsson, Nicole Megow, Clifford Stein

Dagstuhl Reports, 2018

Fast algorithms for knapsack via convolution and prediction.

MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Scheduling When You Don't Know the Number of Machines.

Clifford Stein, Mingxian Zhong

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Online Set Aggregation Problem.

Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Approximate Matchings in Massive Graphs via Local Structure (Invited Talk).

Clifford Stein

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms.

Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Parallel Graph Connectivity in Log Diameter Rounds.

Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, Peilin Zhong

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis.

Jelena Marasevic, Clifford Stein, Gil Zussman

Algorithmica, 2017

Extending Search Phases in the Micali-Vazirani Algorithm.

Michael Huang, Clifford Stein

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

An O(Log Log m)-Competitive Algorithm for Online Machine Minimization.

Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein

Proceedings of the 2017 IEEE Real-Time Systems Symposium, 2017

Simultaneously Load Balancing for Every p-norm, With Reassignments.

Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing.

Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Scheduling (Dagstuhl Seminar 16081).

Nikhil Bansal, Nicole Megow, Clifford Stein

Dagstuhl Reports, 2016

An Empirical Study of Online Packet Scheduling Algorithms.

Nourhan Sakr, Cliff Stein

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Experimental Analysis of Algorithms for Coflow Scheduling.

Zhen Qiu, Clifford Stein, Yuan Zhong

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Faster Fully Dynamic Matchings with Small Approximation Ratios.

Aaron Bernstein, Cliff Stein

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems.

Jelena Marasevic, Clifford Stein, Gil Zussman

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Towards a Convex HMM Surrogate for Word Alignment.

Andrei Simion, Michael Collins, Cliff Stein

Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, 2016

2015

A Fast Distributed Algorithm for α-Fair Packing Problems.

Jelena Marasevic, Clifford Stein, Gil Zussman

CoRR, 2015

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks.

Zhen Qiu, Cliff Stein, Yuan Zhong

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Fully Dynamic Matching in Bipartite Graphs.

Aaron Bernstein, Cliff Stein

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On A Strictly Convex IBM Model 1.

Andrei Simion, Michael Collins, Cliff Stein

Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein

Proceedings of the Approximation, 2015

A Family of Latent Variable Convex Relaxations for IBM Model 2.

Andrei Arsene Simion, Michael Collins, Cliff Stein

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing.

Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein

Proceedings of the Symposium on Theory of Computing, 2014

Maintaining Assignments Online: Matching, Scheduling, and Flows.

Anupam Gupta, Amit Kumar, Cliff Stein

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Some Experiments with a Convex IBM Model 2.

Andrei Simion, Michael Collins, Cliff Stein

Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

2013

Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints.

Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein

Oper. Res. Lett., 2013

The Complexity of Scheduling for p-norms of Flow and Stretch

Benjamin Moseley, Kirk Pruhs, Cliff Stein

CoRR, 2013

The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract).

Benjamin Moseley, Kirk Pruhs, Cliff Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

A Convex Alternative to IBM Model 2.

Andrei Simion, Michael Collins, Cliff Stein

Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, 2013

2012

FairTorrent: A Deficit-Based Distributed Algorithm to Ensure Fairness in Peer-to-Peer Systems.

Alex Sherman, Jason Nieh, Clifford Stein

IEEE/ACM Trans. Netw., 2012

Online scheduling of packets with agreeable deadlines.

Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein

ACM Trans. Algorithms, 2012

Multicast Routing for Energy Minimization Using Speed Scaling.

Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein

Proceedings of the Design and Analysis of Algorithms, 2012

2011

Approximating Semidefinite Packing Programs.

Garud Iyengar, David J. Phillips, Clifford Stein

SIAM J. Optim., 2011

Solving maximum flow problems on real-world bipartite graphs.

Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat

ACM J. Exp. Algorithmics, 2011

Energy Aware Scheduling for Weighted Completion Time and Weighted Tardiness

Rodrigo A. Carrasco, Garud Iyengar, Clifford Stein

CoRR, 2011

2010

On distributing symmetric streaming computations.

Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina

ACM Trans. Algorithms, 2010

Online Stochastic Ad Allocation: Efficiency and Fairness

Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein

CoRR, 2010

Feasible and Accurate Algorithms for Covering Semidefinite Programs.

Garud Iyengar, David J. Phillips, Clifford Stein

Proceedings of the Algorithm Theory, 2010

Online Stochastic Packing Applied to Display Ad Allocation.

Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein

Proceedings of the Algorithms, 2010

How to Schedule When You Have to Buy Your Energy.

Kirk Pruhs, Clifford Stein

Proceedings of the Approximation, 2010

2009

Divide-and-Conquer Approximation Algorithm for Vertex Cover.

Eyjolfur Ingi Asgeirsson, Cliff Stein

SIAM J. Discret. Math., 2009

Speed Scaling for Weighted Flow Time.

Nikhil Bansal, Kirk Pruhs, Clifford Stein

SIAM J. Comput., 2009

Bounded-space online bin cover.

Eyjolfur Ingi Asgeirsson, Cliff Stein

J. Sched., 2009

An O(n^5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions.

David P. Wagner, Robert L. Scot Drysdale, Clifford Stein

Comput. Geom., 2009

Adding Trust to P2P Distribution of Paid Content.

Alex Sherman, Angelos Stavrou, Jason Nieh, Angelos D. Keromytis, Clifford Stein

Proceedings of the Information Security, 12th International Conference, 2009

FairTorrent: bringing fairness to peer-to-peer systems.

Alex Sherman, Jason Nieh, Clifford Stein

Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technology, 2009

Introduction to Algorithms, 3rd Edition.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

MIT Press, ISBN: 9780262533058, 2009

2008

Asymptotic performance of the non-forced idle time scheduling policies in the presence of variable demand for resources.

Ana Radovanovic, Cliff Stein

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

LP Decoding Corrects a Constant Fraction of Errors.

Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright

IEEE Trans. Inf. Theory, 2007

Vertex Cover Approximations on Random Graphs.

Eyjolfur Ingi Asgeirsson, Clifford Stein

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Models of malicious behavior in sponsored search.

Garud Iyengar, David J. Phillips, Clifford Stein

Proceedings of the 2007 Spring Simulation Multiconference, 2007

Better online buffer management.

Fei Li, Jay Sethuraman, Clifford Stein

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Budget optimization in search-based advertising auctions.

Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Non-Preemptive Min-Sum Scheduling with Resource Augmentation.

Nikhil Bansal, Ho-Leung Chan, Rohit Khandekar, Kirk Pruhs, Clifford Stein, Baruch Schieber

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

On the Complexity of Processing Massive, Unordered, Distributed Data

Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina

CoRR, 2006

Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling.

Bogdan Caprita, Jason Nieh, Clifford Stein

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover.

Eyjólfur Ingi Ásgeirsson, Cliff Stein

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Discrete mathematics for computer science.

Kenneth P. Bogart, Clifford Stein, Robert L. Scot Drysdale

Mathematics accross the curriculum, Key College Publishing, ISBN: 978-1-930190-86-3, 2006

2005

Vertex Cover Approximations: Experiments and Observations.

Eyjolfur Ingi Asgeirsson, Clifford Stein

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems.

Bogdan Caprita, Wong Chun Chan, Jason Nieh, Clifford Stein, Haoqiang Zheng

Proceedings of the 2005 USENIX Annual Technical Conference, 2005

An optimal online algorithm for packet scheduling with agreeable deadlines.

Fei Li, Jay Sethuraman, Clifford Stein

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

LP decoding achieves capacity.

Jon Feldman, Clifford Stein

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Approximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring.

Garud Iyengar, David J. Phillips, Clifford Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

An O(n^5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem.

Robert L. Scot Drysdale, Clifford Stein, David P. Wagner

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Approximating disjoint-path problems using packing integer programs.

Stavros G. Kolliopoulos, Clifford Stein

Math. Program., 2004

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut.

David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young

Math. Oper. Res., 2004

Scheduling an Industrial Production Facility.

Eyjolfur Ingi Asgeirsson, Jonathan W. Berry, Cynthia A. Phillips, David J. Phillips, Clifford Stein, Joel Wein

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Networks and Flows.

Clifford Stein, Lisa Fleischer, Douglas R. Shier, Prakash Mirchandani, David Simchi-Levi

Proceedings of the Handbook of Graph Theory., 2003

2002

Optimal Time-Critical Scheduling via Resource Augmentation.

Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein

Algorithmica, 2002

Minimizing Makespan for the Lazy Bureaucrat Problem.

Clint Hepner, Clifford Stein

Proceedings of the Algorithm Theory, 2002

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.

April Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Approximation Algorithms for Single-Source Unsplittable Flow.

Stavros G. Kolliopoulos, Clifford Stein

SIAM J. Comput., 2001

Approximation Techniques for Average Completion Time Scheduling.

Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein

SIAM J. Comput., 2001

Reducing Mass Degeneracy in SAR by MS by Stable Isotopic Labeling.

Christopher Bailey-Kellogg, John J. Kelley, Clifford Stein, Bruce Randall Donald

J. Comput. Biol., 2001

Scheduling Multi-task Agents.

Rong Xie, Daniela Rus, Clifford Stein

Proceedings of the Mobile Agents, 5th International Conference, 2001

Simultaneously optimizing two scheduling objectives.

Clifford Stein

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Approximation Algorithms for the Minimum Bends Traveling Salesman Problem.

Clifford Stein, David P. Wagner

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Implementation of a PTAS for Scheduling with Release Dates.

Clint Hepner, Clifford Stein

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

Scheduling multi-task multi-agent systems.

Rong Xie, Daniela Rus, Clifford Stein

Proceedings of the Fifth International Conference on Autonomous Agents, 2001

Introduction to Algorithms, Second Edition

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

The MIT Press and McGraw-Hill Book Company, ISBN: 0-07-013151-1, 2001

2000

Clustering Data without Prior Knowledge.

Javed A. Aslam, Alain Leblanc, Clifford Stein

Proceedings of the Algorithm Engineering, 2000

1999

Improved Bicriteria Existence Theorems for Scheduling.

Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.

Stavros G. Kolliopoulos, Clifford Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.

Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Scheduling Algorithms.

David R. Karger, Cliff Stein, Joel Wein

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Minimizing average completion time in the presence of release dates.

Cynthia A. Phillips, Clifford Stein, Joel Wein

Math. Program., 1998

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.

Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein

J. Comb. Optim., 1998

Finding Real-Valued Single-Source Shortest Paths in <i>o(n³)</i> Expected Time.

Stavros G. Kolliopoulos, Clifford Stein

J. Algorithms, 1998

A 2 2/3 Superstring Approximation Algorithm.

Chris Armen, Clifford Stein

Discret. Appl. Math., 1998

Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs.

Stavros G. Kolliopoulos, Clifford Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.

Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Task Scheduling in Networks.

Cynthia A. Phillips, Clifford Stein, Joel Wein

SIAM J. Discret. Math., 1997

On the existence of schedules that are near-optimal for both makespan and total weighted completion time.

Clifford Stein, Joel Wein

Oper. Res. Lett., 1997

Distributed Job Scheduling in Rings.

Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein

J. Parallel Distributed Comput., 1997

Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract).

Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Experimental Study of Minimum Cut Algorithms.

Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Improved Approximation Algorithms for Unsplittable Flow Problems.

Stavros G. Kolliopoulos, Clifford Stein

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

A New Approach to the Minimum Cut Problem.

David R. Karger, Clifford Stein

J. ACM, 1996

Finding Real-Valued Single-Source Shortest Paths.

Stavros G. Kolliopoulos, Clifford Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Improved Scheduling Algorithms for Minsum Criteria.

Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem.

Chris Armen, Clifford Stein

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

Fast Approximation Algorithms for Multicommodity Flow Problems.

Frank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas

J. Comput. Syst. Sci., 1995

Short Superstrings and the Structure of Overlapping Strings.

Chris Armen, Clifford Stein

J. Comput. Biol., 1995

Scheduling Jobs that Arrive Over Time (Extended Abstract).

Cynthia A. Phillips, Clifford Stein, Joel Wein

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract).

Chris Armen, Clifford Stein

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Improved Approximation Algorithms for Shop Scheduling Problems.

David B. Shmoys, Clifford Stein, Joel Wein

SIAM J. Comput., 1994

Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.

Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos

SIAM J. Comput., 1994

Improved Algorithms for Bipartite Network Flow.

Ravindra K. Ahuja, James B. Orlin, Clifford Stein, Robert Endre Tarjan

SIAM J. Comput., 1994

Task Scheduling in Networks (Extended Abstract).

Cynthia A. Phillips, Clifford Stein, Joel Wein

Proceedings of the Algorithm Theory, 1994

Job Scheduling in Rings.

Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Long Tours and Short Superstrings (Preliminary Version)

S. Rao Kosaraju, James K. Park, Clifford Stein

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Parallel algorithms for the assignment and minimum-cost flow problems.

James B. Orlin, Clifford Stein

Oper. Res. Lett., 1993

A Parallel Algorithm for Approximating the Minimum Cycle Cover.

Philip N. Klein, Clifford Stein

Algorithmica, 1993

An O~(n²) algorithm for minimum cuts.

David R. Karger, Clifford Stein

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992

Approximation algorithms for multicommodity flow and shop scheduling problems.

Clifford Stein

PhD thesis, 1992

Approximating the Minimum-Cost Maximum Flow is P-Complete.

Clifford Stein, Joel Wein

Inf. Process. Lett., 1992

1991

Implementation of a Combinatorial Multicommodity Flow Algorithm.

Tishya Leong, Peter W. Shor, Clifford Stein

Proceedings of the Network Flows And Matching, 1991

1990

A Parallel Algorithm for Eliminating Cycles in Undirected Graphs.

Philip N. Klein, Clifford Stein

Inf. Process. Lett., 1990

Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities

Philip N. Klein, Clifford Stein, Éva Tardos

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990