Overflow management with self-eliminations
From MaRDI portal
Publication:5918714
DOI10.1007/978-3-030-89240-1_9zbMath1498.68045OpenAlexW3205061364MaRDI QIDQ5918714
Publication date: 24 June 2022
Published in: Algorithms for Sensor Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-89240-1_9
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Shrinking maxima, decreasing costs: new online packing and covering problems
- Online scheduling with interval conflicts
- Competitive buffer management with packet dependencies
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Scheduling multipacket frames with frame deadlines
- Independent sets with domination constraints
- Competitive router scheduling with structured data
- On the complexity of approximating \(k\)-set packing
- Online Set Packing
- Buffer Overflow Management in QoS Switches
- Optimal smoothing schedules for real-time streams
- Introduction to Coding Theory
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Overflow management with self-eliminations