Resource time-sharing for IoT applications with deadlines

DOI10.1007/978-3-031-22050-0_7OpenAlexW4312284799MaRDI QIDQ6112000

George Karakostas, Stavros G. Kolliopoulos

Publication date: 4 August 2023

Published in: Algorithmics of Wireless Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22050-0_7

zbMATH Keywords

schedulingdeadlinestime-sharingtolerance capacities

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• The transportation problem with conflicts
• The Trim Problem
• Better Bin Packing Approximations via Discrepancy Theory
• Tight Approximation Algorithms for Maximum Separable Assignment Problems
• The Santa Claus problem
• A threshold of ln n for approximating set cover
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• A Linear Programming Approach to the Cutting-Stock Problem
• Dependent rounding and its applications to approximation algorithms
• Randomized metarounding
• A new approximation technique for resource‐allocation problems
• Santa Claus Schedules Jobs on Unrelated Machines
• A Quasi-Polynomial Approximation for the Restricted Assignment Problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Resource time-sharing for IoT applications with deadlines