scientific article; zbMATH DE number 7561425

DOI10.4230/LIPIcs.ISAAC.2018.71MaRDI QIDQ5091067

Samarjit Chakraborty, Nikhil Bansal, Jian-Jia Chen, Brüggen Georg von der

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1809.04355

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation factorsmultiprocessor partitioned scheduling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• There is no asymptotic PTAS for two-dimensional vector packing
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Bin packing can be solved within 1+epsilon in linear time
• A survey of hard real-time scheduling for multiprocessor systems
• A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks
• New strategies for assigning real-time tasks to multiprocessor systems
• An ℴ(log m)-Competitive Algorithm for Online Machine Minimization
• On Multidimensional Packing Problems
• Applications of approximation algorithms to cooperative games
• Approximating Real-Time Scheduling on Identical Machines
• Bounds on Multiprocessing Timing Anomalies
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: