Imagen de Portada

A Competitive Algorithm for Throughput Maximization on Identical Machines

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Competitive Online Transportation Simplified
por: Arndt, Stephen, et al.
Publicado: (2025)

Robust Gittins for Stochastic Scheduling
por: Moseley, Benjamin, et al.
Publicado: (2025)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
por: Arndt, Stephen, et al.
Publicado: (2026)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
por: Arndt, Stephen, et al.
Publicado: (2025)

Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
por: Moseley, Benjamin, et al.
Publicado: (2026)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
por: Im, Sungjin, et al.
Publicado: (2023)

An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
por: Arndt, Stephen, et al.
Publicado: (2026)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
por: Armbruster, Alexander, et al.
Publicado: (2026)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
por: Kawase, Yasushi, et al.
Publicado: (2025)

Faster Global Minimum Cut with Predictions
por: Moseley, Benjamin, et al.
Publicado: (2025)

Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
por: Moseley, Benjamin, et al.
Publicado: (2024)

Indirect Coflow Scheduling
por: Lindermayr, Alexander, et al.
Publicado: (2025)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
por: Ganz, Amit, et al.
Publicado: (2023)

Drawing Competitive Districts in Redistricting
por: Chuang, Gabriel, et al.
Publicado: (2024)

Incremental Topological Ordering and Cycle Detection with Predictions
por: McCauley, Samuel, et al.
Publicado: (2024)

Submodular Max-Min Allocation under Identical Valuations
por: Boehmer, Kimon
Publicado: (2026)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
por: Chen, Wenjing, et al.
Publicado: (2023)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
por: Dufay, Marc, et al.
Publicado: (2025)

Real Time Proportional Throughput Maximization: How much advance notice should you give your scheduler?
por: Mottu, Nadim A.
Publicado: (2025)

The Power of Migrations in Dynamic Bin Packing
por: Mellou, Konstantina, et al.
Publicado: (2024)

Improved Algorithms for Fair Matroid Submodular Maximization
por: Mahabadi, Sepideh, et al.
Publicado: (2026)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
por: Davies, Sami, et al.
Publicado: (2023)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
por: Cervenjak, Philip, et al.
Publicado: (2026)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

A Competitive Algorithm for Agnostic Active Learning
por: Price, Eric, et al.
Publicado: (2023)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
por: Zhu, Yanhui, et al.
Publicado: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
por: Cervenjak, Philip, et al.
Publicado: (2023)

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
por: Bijoy, Adithya, et al.
Publicado: (2025)

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
por: Basiak, Mateusz, et al.
Publicado: (2025)

An Empirical Study of Online Packet Scheduling Algorithms
por: Sakr, Nourhan, et al.
Publicado: (2016)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
por: Rui, Xiaobin, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
por: Buchbinder, Niv, et al.
Publicado: (2026)

Waiting is worth it and can be improved with predictions
por: Liang, Ya-Chun, et al.
Publicado: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
por: Clifford, Peter, et al.
Publicado: (2026)