:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Mottu, Nadim A.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2511.16023
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Competitive Algorithm for Throughput Maximization on Identical Machines
by: Moseley, Benjamin, et al.
Published: (2021)

Speed-robust scheduling revisited
by: Minařík, Josef, et al.
Published: (2024)

Noisy Computing of the Threshold Function
by: Wang, Ziao, et al.
Published: (2024)

Online busy time scheduling with flexible jobs
by: Albers, Susanne, et al.
Published: (2024)

Proportionally Fair Matching via Randomized Rounding
by: Duppala, Sharmila, et al.
Published: (2024)

How to Find Long Maximal Exact Matches and Ignore Short Ones
by: Gagie, Travis
Published: (2024)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
by: Bernstein, Aaron, et al.
Published: (2025)

A simpler QPTAS for scheduling jobs with precedence constraints
by: Das, Syamantak, et al.
Published: (2025)

On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
by: Amir, Amihood, et al.
Published: (2026)

Stochastic scheduling with Bernoulli-type jobs through policy stratification
by: Antoniadis, Antonios, et al.
Published: (2025)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
by: Fischer, David, et al.
Published: (2022)

How fast can you find a good hypothesis?
by: Aamand, Anders, et al.
Published: (2025)

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
by: Jäger, Sven, et al.
Published: (2024)

Revoke vs. Restart in Unweighted Throughput Scheduling
by: He, Changdao
Published: (2025)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
by: Armbruster, Alexander, et al.
Published: (2025)

Regularized Unconstrained Weakly Submodular Maximization
by: Zhu, Yanhui, et al.
Published: (2024)

QuadRank: Engineering a High Throughput Rank
by: Koerkamp, R. Groot
Published: (2026)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
by: Li, Shuguang, et al.
Published: (2025)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
by: Harris, David G.
Published: (2023)

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

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
by: Hathcock, Daniel, et al.
Published: (2025)

Maximal Palindromes in MPC: Simple and Optimal
by: Pissis, Solon P.
Published: (2025)

Fair Diversity Maximization with Few Representatives
by: Adriaens, Florian, et al.
Published: (2025)

Streaming Maximal Matching with Bounded Deletions
by: Khanna, Sanjeev, et al.
Published: (2025)

Submodular Maximization in Exactly $n$ Queries
by: Balkanski, Eric, et al.
Published: (2024)

Maximizing the Minimum Eigenvalue in Constant Dimension
by: Brown, Adam, et al.
Published: (2024)

Learning-Augmented Dynamic Submodular Maximization
by: Agarwal, Arpit, et al.
Published: (2023)

A Poisson Process for Submodular Maximization
by: Rozenman, Amit Ganz, et al.
Published: (2026)

Time To Replace Your Filter: How Maplets Simplify System Design
by: Bender, Michael A., et al.
Published: (2025)

Relating Left and Right Extensions of Maximal Repeats
by: Inenaga, Shunsuke, et al.
Published: (2024)

Maximizing Reachability via Shifting of Temporal Paths
by: Deligkas, Argyrios, et al.
Published: (2026)

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

A probabilistic analysis on general probabilistic scheduling problems
by: Suruga, Daiki
Published: (2024)

Fair Submodular Maximization over a Knapsack Constraint
by: Li, Lijun, et al.
Published: (2025)

Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)

Subquadratic Submodular Maximization with a General Matroid Constraint
by: Kobayashi, Yusuke, et al.
Published: (2024)

Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
by: Berg, Magnus
Published: (2024)

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

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