ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Threshold-based resource allocation”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DScs.DMTheoreticalRecentJul 28, 2026

Stochastic Load Balancing with Machine Reservations

David Alemán Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver +1 more

A new stochastic load balancing model is introduced that allows for a tradeoff between non-adaptive policies and performance, with results showing a 2-reservation approximation to the omniscient optim…

View →
cs.DScs.GTcs.LGTheoreticalRecentJun 17, 2026

Fair Online Resource Allocation

Christopher En, Yuri Faenza, Andrea Lodi, Gonzalo Muñoz

This paper studies fair online resource allocation with a Lipschitz fairness requirement and proposes an algorithm to maximize welfare while enforcing fairness.

View →
cs.CCcs.DSTheoreticalRecentOct 26, 2026

The Complexity of Value Optimization in Sporadic Task Systems

Christopher Harbourne, Nathan Fisher, Kecheng Yang, Pontus Ekberg +2 more

This paper studies the complexity of Value-based Task Selection (VTS) in real-time systems.

View →
cs.CRcs.NIApr 24, 2026

Resource-Aware Layered Intrusion Detection Allocation Model

Ioan Pădurean, Béla Genge, Roland Bolboacă

The paper proposes a resource-aware integer linear programming model to optimally allocate monitoring depth across heterogeneous network devices, balancing detection capability against computational a…

View →
cs.DSTheoreticalRecentJul 17, 2026

Revisiting Real-Time Interval and Throughput Maximization

Allan Borodin, Changdao He, Nadim Mottu

The paper extends results for interval scheduling to the more general throughput problem in the real-time model with constant competitive ratios for specific weight functions and advance notice.

View →
cs.DScs.CCTheoreticalRecentJun 13, 2026

Threshold Minimum Cut with Terminal Quotas: Logarithmic and Planar Approximation Algorithms

Qi Duan

This paper studies threshold minimum cut problems and provides approximation guarantees for various cases.

View →
cs.CRRecentMay 28, 2026

Scarcity Is Not Enough: An Impossibility Result for Linear Sybil Cost Under Parallelizable Resources

Homayoun Maleki, Nekane Sainz, Jon Legarda, Igor Santos-Grueiro

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

View →
cs.GTcs.CCcs.DSTheoreticalRecentOct 20, 2026

Subjective Valuations Make It Hard to be Fair: The Complexity of Resource Allocation to Groups of Agents

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith +2 more

This paper studies the parameterized complexity of finding an EF1 allocation of indivisible items in the group-sharing setting.

View →
cs.DSTheoreticalRecentOct 19, 2026

A Tight Oracle Threshold for \(k\)-Submodular Maximization

Siyuan Chen

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

View →
cs.DScs.CCTheoreticalRecentNov 12, 2026

Individually Fair Facility Location

Rajni Dabas, Samir Khuller, Milind Maiti

The paper studies the problem of individually fair facility location and provides a polynomial-time algorithm with a constant cost factor.

View →
cs.DSTheoreticalRecentOct 19, 2026

Capacitated Line Aggregation with Maximum Delay

Runtian Ren, Shengcai Liu

This paper studies capacitated line aggregation with per-batch maximum delay and presents several algorithms with competitive ratios.

View →
cs.DScs.DMTheoreticalRecentAug 11, 2026

The Minimum-Weight Mixed Dominating Set on Threshold Graphs

Emiliano Lancini, Oulin Yang

This paper presents algorithms for the minimum-weight mixed dominating set problem on threshold graphs, reducing it to the minimum-weight edge-cover problem and achieving running times of O(n^3) and O…

View →
cs.NImath.OCEmpiricalRecentJun 24, 2026

Dependency-Aware Dominant Resource Fairness for Multi-Tenant Multi-Resource Systems

Braik Zeidan, Francesca Fossati, Sahar Hoteit, Stefano Secci

This paper proposes a new policy for multi-resource allocation in network-congested systems that considers inter-resource dependencies.

View →
math.PRcs.LGeess.SYTheoreticalRecentJun 16, 2026

Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholds

Hao Liang, Cheng Tang, Yunzong Xu

This paper studies finite-horizon queue peaks in generalized switches and provides new bounds and insights.

View →