Copertina

The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jäger, Sven, Lindermayr, Alexander, Megow, Nicole
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Non-Clairvoyant Scheduling with Progress Bars
di: Benomar, Ziyad, et al.
Pubblicazione: (2025)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
di: Lindermayr, Alexander, et al.
Pubblicazione: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
di: Lindermayr, Alexander, et al.
Pubblicazione: (2025)

Competitive Kill-and-Restart and Preemptive Strategies for Non-Clairvoyant Scheduling
di: Jäger, Sven, et al.
Pubblicazione: (2022)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
di: Gupta, Anupam, et al.
Pubblicazione: (2026)

A Little Clairvoyance Is All You Need
di: Gupta, Anupam, et al.
Pubblicazione: (2025)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
di: Feng, Yiding, et al.
Pubblicazione: (2026)

Accelerating Matroid Optimization through Fast Imprecise Oracles
di: Eberle, Franziska, et al.
Pubblicazione: (2024)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment
di: Ezra, Tomer, et al.
Pubblicazione: (2024)

Learning-Augmented Online Scheduling with Parsimonious Preemption
di: Blue, Mugen, et al.
Pubblicazione: (2026)

Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
di: Diwan, Haya, et al.
Pubblicazione: (2025)

Two-Edge Connectivity via Pac-Man Gluing
di: Garg, Mohit, et al.
Pubblicazione: (2024)

A Better-Than-$5/4$-Approximation for Two-Edge Connectivity
di: Hommelsheim, Felix, et al.
Pubblicazione: (2025)

Indirect Coflow Scheduling
di: Lindermayr, Alexander, et al.
Pubblicazione: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
di: Hommelsheim, Felix, et al.
Pubblicazione: (2025)

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

Online Flow Time Minimization with Gradually Revealed Jobs
di: Lindermayr, Alexander, et al.
Pubblicazione: (2026)

Improved Rank Aggregation under Fairness Constraint
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2025)

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

Approximation Algorithms for Fair Repetitive Scheduling
di: Hermelin, Danny, et al.
Pubblicazione: (2025)

LLM Query Scheduling with Prefix Reuse and Latency Constraints
di: Dexter, Gregory, et al.
Pubblicazione: (2025)

Fairness in Repetitive Scheduling
di: Hermelin, Danny, et al.
Pubblicazione: (2021)

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
di: Inamdar, Tanmay, et al.
Pubblicazione: (2024)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
di: Chen, Wenjing, et al.
Pubblicazione: (2026)

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

Online Makespan Scheduling under Scenarios
di: Ergen, Ekin
Pubblicazione: (2025)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
di: Chandrasekaran, Karthekeyan, et al.
Pubblicazione: (2023)

Job Scheduling under Base and Additional Fees, with Applications to Mixed-Criticality Scheduling
di: Hsieh, Yi-Ting, et al.
Pubblicazione: (2025)

Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines
di: Hertrich, Christoph, et al.
Pubblicazione: (2020)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
di: Chen, Chi-Yeh
Pubblicazione: (2025)

Shortest Paths on Convex Polyhedral Surfaces
di: Wang, Haitao
Pubblicazione: (2025)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
di: Chen, Tianqi, et al.
Pubblicazione: (2025)

Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
di: Gadekar, Ameet, et al.
Pubblicazione: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
di: Bhore, Sujoy, et al.
Pubblicazione: (2025)

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

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
di: Shahbazi, Nima, et al.
Pubblicazione: (2025)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
di: Hao, Yimin, et al.
Pubblicazione: (2025)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
di: Mendoza-Cadena, Mirabel, et al.
Pubblicazione: (2026)

Block Coordinate Descent Methods for Optimization under J-Orthogonality Constraints with Applications
di: He, Di, et al.
Pubblicazione: (2024)

Fair Repetitive Interval Scheduling
di: Heeger, Klaus, et al.
Pubblicazione: (2024)