Parameterized hardness results for the \textsc{Restricted Santa Claus Problem}

DOI10.1007/978-3-032-17156-6_22MaRDI QIDQ7307331zbMATH OpenFDO

Authors S. Anil Kumar, N. S. Narayanaswamy

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_22

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A Tale of Santa Claus, Hypergraphs and Matroids
• Bin packing with fixed number of bins revisited
• Bounding the running time of algorithms for scheduling and packing problems
• Combinatorial algorithm for restricted max-min fair allocation
• Complexity of scheduling few types of jobs on related and unrelated machines
• Exact algorithms for allocation problems
• Losing weight by gaining edges
• Parameterized algorithms
• Parameterized and approximation results for scheduling with a low rank processing time matrix
• Santa claus meets hypergraph matchings
• Santa claus meets makespan and matroids: algorithms and reductions
• Scheduling and fixed-parameter tractability
• The Santa Claus problem

This page was built for publication: Parameterized hardness results for the \textsc{Restricted Santa Claus Problem}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307331)