Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Santa Claus problem"”.

  1. Designing Scheduling Algorithms via a Mathematical Perspective

    This document will discuss three problems that I worked on during my Ph.D. Chapter \ref{chapter: SC} contains my work on the Santa Claus problem, and Chapters \ref{chapter: S1} and \ref{chapter: S2} contain my work on scheduling with precedence constraints and communication delays. New algorithms …

    washington Repository record for Designing Scheduling Algorithms via a Mathematical Perspective (opens in a new tab)

  2. Approximation Algorithms for Resource Allocation

    … and algorithms for combinatorial optimization problems arising in various applications of resource allocation. Resource allocation refers to a class of problems where scarce resources must be distributed among competing agents maintaining certain optimization criteria. Examples include …

    maryland Repository record for Approximation Algorithms for Resource Allocation (opens in a new tab)

  3. Santa Claus, Machine Scheduling and Bipartite Hypergraphs

    Here we discuss two related discrete optimization problems, a prominent problem in scheduling theory, makespan minimization on unrelated parallel machines, and the other a fair allocation problem, the Santa Claus problem. In each case the objective is to make the least well off participant as well …

    waterloo Repository record for Santa Claus, Machine Scheduling and Bipartite Hypergraphs (opens in a new tab)

  4. Approximation Algorithms for Scheduling and Fair Allocations

    … results on the general max-min allocation. The Santa Claus problem is also known as the restricted max-min fair allocation. In this problem, Santa Claus has a set of gifts, and he wants to distribute them among a set of children so that the least happy child is made as happy as possible. Here, …

    washington Repository record for Approximation Algorithms for Scheduling and Fair Allocations (opens in a new tab)

  5. Membrane computing :The computational power of cP and water systems

    … time that cP systems can solve PSPACE complete problems in polynomial time (linear). We will also, demonstrate the advantages of our solution compared to other P system variants. Following this positive result, we demonstrate e cient solutions to NP-complete problems surpassing previous results. …

    auckland-ms Repository record for Membrane computing :The computational power of cP and water systems (opens in a new tab)

  6. The Price of Fairness in Algorithmic Decision-Making

    … In the first part, I examine the fair division problem, which seeks to distribute resources among stakeholders in an equitable and efficient manner. I introduce novel approaches for balancing fairness constraints with computational feasibility, investigating both offline and online settings. In …

    maryland Repository record for The Price of Fairness in Algorithmic Decision-Making (opens in a new tab)