Benjamin Moseley

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Controlling Tail Risk in Online Ski-Rental.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Database Theory, 2024

Sampling for Beyond-Worst-Case Online Ranking.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Mathematical challenges in scheduling theory.

[BibT_eX]

[DOI]

J. Sched., December, 2023

Scheduling (Dagstuhl Seminar 23061).

[BibT_eX]

[DOI]

Dagstuhl Reports, February, 2023

Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search.

[BibT_eX]

[DOI]

Joshua R. Wang

J. Mach. Learn. Res., 2023

Massively Parallel Computation: Algorithms and Applications.

[BibT_eX]

[DOI]

Found. Trends Optim., 2023

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs.

[BibT_eX]

[DOI]

CoRR, 2023

On the Convergence Rate of Linear Datalogo over Stable Semirings.

[BibT_eX]

[DOI]

CoRR, 2023

One Partition Approximating All 𝓁<sub>p</sub>-norm Objectives in Correlation Clustering.

[BibT_eX]

[DOI]

Sami Davies

CoRR, 2023

Online k-Median with Consistent Clusters.

[BibT_eX]

[DOI]

CoRR, 2023

Minimizing Completion Times for Stochastic Jobs via Batched Free Times.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases: Research Track, 2023

Online List Labeling with Predictions.

[BibT_eX]

[DOI]

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

Configuration Balancing for Stochastic Requests.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Online Dynamic Acknowledgement with Learned Predictions.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2023, 2023

Predictive Flows for Faster Ford-Fulkerson.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Fast Combinatorial Algorithms for Min Max Correlation Clustering.

[BibT_eX]

[DOI]

Sami Davies

Proceedings of the International Conference on Machine Learning, 2023

Min-Max Submodular Ranking for Multiple Agents.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models.

[BibT_eX]

[DOI]

Ruilong Zhang

Shanjiawen Zhao

Theor. Comput. Sci., 2022

The Case for Phase-Aware Scheduling of Parallelizable Jobs.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2022

The efficiency-fairness balance of Round Robin scheduling.

[BibT_eX]

[DOI]

Shai Vardi

Oper. Res. Lett., 2022

On the impossibility of decomposing binary matroids.

[BibT_eX]

[DOI]

Marilena Leichter

Oper. Res. Lett., 2022

Optimizing Polymatroid Functions.

[BibT_eX]

[DOI]

CoRR, 2022

Automatic HBM Management: Models and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Algorithms with Prediction Portfolios.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Competitive Algorithm for Throughput Maximization on Identical Machines.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Learning-Augmented Algorithms for Online Steiner Tree.

[BibT_eX]

[DOI]

Chenyang Xu

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Online Non-preemptive Scheduling on Unrelated Machines with Rejections.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

New Perspectives in Scheduling Theory.

[BibT_eX]

[DOI]

J. Sched., 2021

The Matroid Cup Game.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

The matroid intersection cover problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

A Competitive Algorithm for Throughout Maximization on Identical Machines.

[BibT_eX]

[DOI]

CoRR, 2021

Robust Online Correlation Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Faster Matchings via Learned Duals.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

An Approximation Algorithm for the Matrix Tree Multiplication Problem.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Instance Optimal Join Size Estimation.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Relational Algorithms for k-Means Clustering.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Structural Iterative Rounding for Generalized k-Median Problems.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

A Scalable Approximation Algorithm for Weighted Longest Common Subsequence.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2021: Parallel Processing, 2021

An Efficient Reduction of a Gammoid to a Partition Matroid.

[BibT_eX]

[DOI]

Marilena Leichter

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

Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing.

[BibT_eX]

[DOI]

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

A Relational Gradient Descent Algorithm For Support Vector Machine Training.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Approximate Aggregate Queries Under Additive Inequalities.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors.

[BibT_eX]

[DOI]

Sergei Vassilvitskii

Yuyan Wang

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Scaling Average-Linkage via Sparse Cluster Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Asian Conference on Machine Learning, 2021

Using Predicted Weights for Ad Delivery.

[BibT_eX]

[DOI]

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Functional Aggregate Queries with Additive Inequalities.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2020

Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization.

[BibT_eX]

[DOI]

Shi Li

SIAM J. Discret. Math., 2020

Fair Scheduling via Iterative Quasi-Uniform Sampling.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Hallucination Helps: Energy Efficient Virtual Circuit Routing.

[BibT_eX]

[DOI]

Antonios Antoniadis

Ravishankar Krishnaswamy

SIAM J. Comput., 2020

Dynamic Weighted Fairness with Minimal Disruptions.

[BibT_eX]

[DOI]

Proc. ACM Meas. Anal. Comput. Syst., 2020

Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP.

[BibT_eX]

[DOI]

CoRR, 2020

How to Manage High-Bandwidth Memory Automatically.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Optimal Resource Allocation for Elastic and Inelastic Jobs.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Online Scheduling via Learned Weights.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Fair Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A Scheduling Approach to Incremental Maintenance of Datalog Programs.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks.

[BibT_eX]

[DOI]

Michael Dinitz

Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Unconditional Coresets for Regularized Loss Minimization.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Fast Noise Removal for k-Means Clustering.

[BibT_eX]

[DOI]

Mahshid Montazer Qaem

Xiaorui Sun

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Rk-means: Fast Clustering for Relational Data.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means.

[BibT_eX]

[DOI]

Yuyan Wang

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

On Coresets for Regularized Loss Minimization.

[BibT_eX]

[DOI]

CoRR, 2019

A Conditional Lower Bound on Graph Connectivity in MapReduce.

[BibT_eX]

[DOI]

CoRR, 2019

Non-clairvoyantly Scheduling to Minimize Convex Functions.

[BibT_eX]

[DOI]

Algorithmica, 2019

A Framework for Parallelizing Hierarchical Clustering Methods.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

Cost Effective Active Search.

[BibT_eX]

[DOI]

Shali Jiang

Roman Garnett

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Backprop with Approximate Activations for Memory-efficient Network Training.

[BibT_eX]

[DOI]

Ayan Chakrabarti

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Practically Efficient Scheduler for Minimizing Average Flow Time of Parallel Jobs.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Scheduling to Approximate Minimization Objectives on Identical Machines.

[BibT_eX]

[DOI]

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

Matroid Coflow Scheduling.

[BibT_eX]

[DOI]

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

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Submodular Optimization with Contention Resolution Extensions.

[BibT_eX]

[DOI]

Maxim Sviridenko

Proceedings of the Approximation, 2019

2018

Energy efficient scheduling of parallelizable jobs.

[BibT_eX]

[DOI]

Kyle Fox

Theor. Comput. Sci., 2018

New challenges in scheduling theory.

[BibT_eX]

[DOI]

J. Sched., 2018

Scheduling Parallel Jobs Online with Convex and Concave Parallelizability.

[BibT_eX]

[DOI]

Roozbeh Ebrahimi

Samuel McCauley

Theory Comput. Syst., 2018

Efficient nonmyopic active search with applications in drug and materials discovery.

[BibT_eX]

[DOI]

CoRR, 2018

Pre-Synaptic Pool Modification (PSPM): A Supervised Learning Procedure for Spiking Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient nonmyopic batch active search.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Scheduling Parallelizable Jobs Online to Maximize Throughput.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Local Search Methods for k-Means with Outliers.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

Efficient massively parallel methods for dynamic programming.

[BibT_eX]

[DOI]

Xiaorui Sun

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

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

[BibT_eX]

[DOI]

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

Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization.

[BibT_eX]

[DOI]

Shi Li

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Stochastic Online Scheduling on Unrelated Machines.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Efficient Nonmyopic Active Search.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

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

[BibT_eX]

[DOI]

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

Cooperative Set Function Optimization Without Communication or Coordination.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Competitively Scheduling Tasks with Intermediate Parallelizability.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

General Profit Scheduling and the Power of Migration on Heterogeneous Machines.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time.

[BibT_eX]

[DOI]

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

Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines.

[BibT_eX]

[DOI]

Shaurya Ahuja

Kefu Lu

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

Fast Greedy Algorithms in MapReduce and Streaming.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2015

Scheduling to minimize energy and flow time in broadcast scheduling.

[BibT_eX]

[DOI]

J. Sched., 2015

Stochastic Scheduling of Heavy-tailed Jobs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Scheduling in Bandwidth Constrained Tree Networks.

[BibT_eX]

[DOI]

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

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering.

[BibT_eX]

[DOI]

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

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time.

[BibT_eX]

[DOI]

Janardhan Kulkarni

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

A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Fast Distributed k-Center Clustering with Outliers on Massive Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

k-Means Clustering on Two-Level Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Symposium on Memory Systems, 2015

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities.

[BibT_eX]

[DOI]

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

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs.

[BibT_eX]

[DOI]

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

2014

Online Scheduling with General Cost Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

New Approximations for Reordering Buffer Management.

[BibT_eX]

[DOI]

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

Packet Forwarding Algorithms in a Line Network.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

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

[BibT_eX]

[DOI]

Cliff Stein

CoRR, 2013

Brief announcement: online batch scheduling for flow objectives.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

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

[BibT_eX]

[DOI]

Cliff Stein

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Bargaining for Revenue Shares on Tree Trading Networks.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Online scheduling algorithms for broadcasting and general cost functions

[BibT_eX]

[DOI]

PhD thesis, 2012

Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor.

[BibT_eX]

[DOI]

Theory Comput., 2012

An online scalable algorithm for average flow time in broadcast scheduling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Scalable K-Means++.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

Speed scaling for stretch plus energy.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

Handling forecast errors while bidding for display advertising.

[BibT_eX]

[DOI]

Kevin J. Lang

Sergei Vassilvitskii

Proceedings of the 21st World Wide Web Conference 2012, 2012

Scheduling heterogeneous processors isn't as easy as you think.

[BibT_eX]

[DOI]

Ravishankar Krishnaswamy

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Shortest-Elapsed-Time-First on a Multiprocessor.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

2011

A tutorial on amortized local competitiveness in online scheduling.

[BibT_eX]

[DOI]

SIGACT News, 2011

On scheduling in map-reduce and flow-shops.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Filtering: a method for solving graph problems in MapReduce.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Online Scheduling on Identical Machines using SRPT.

[BibT_eX]

[DOI]

Kyle Fox

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work.

[BibT_eX]

[DOI]

Jeff Edmonds

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Fast clustering using MapReduce.

[BibT_eX]

[DOI]

Alina Ene

Richard Matthew McCutchen

Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010

New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract).

[BibT_eX]

[DOI]

Louiqa Raschid

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Scheduling jobs with varying parallelizability to reduce variance.

[BibT_eX]

[DOI]

Ravishankar Krishnaswamy

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2009

Longest Wait First for Broadcast Scheduling

[BibT_eX]

[DOI]

CoRR, 2009

Longest Wait First for Broadcast Scheduling [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Online scheduling to minimize the maximum delay factor.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling.

[BibT_eX]

[DOI]