Next, we will study algorithms for NP-hard problems whose solutions are guaranteed to be within some approximation factor of the best possible solutions. Such algorithms are often quite efficient and ...

This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for set cover, k-cut, k-center, feedback vertex set, ...

The Stanford researchers apply Grover’s algorithm to the number partitioning problem by encoding each possible partition of the integer list as a quantum state. They also formulate an oracle that can ...

The bipartite traveling tournament problem (BTTP) is an NP-complete scheduling problem whose solution is a double round-robin inter-league tournament with minimum total travel distance.

This problem has received a lot of attention over the years, and many heuristic and approximation algorithms have been suggested. However, in spite of the vast effort, the complexity of the problem ...

The math of organ donation: Kidneys are an NP-hard problem Matching donors and recipients is a bit like the traveling salesman problem.