Dynamic Programming
Explore dynamic programming techniques for solving complex algorithmic problems efficiently, including coin change, knapsack, and longest common subsequence.
Using Lattices for Cryptanalysis
Explore lattice-based cryptanalysis techniques, including Coppersmith's method and attacks on NTRU, with applications to breaking classical cryptography and solving mathematical problems.
A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Explore efficient algorithms for submodular maximization with knapsack constraints, focusing on nearly-linear time solutions and their applications in discrete optimization.
Algorithmic Mechanism Design with Investment
Explore approximation algorithms for knapsack problems, focusing on allocation efficiency and investment incentives in mechanism design without confirming negative externalities.
0/1 Knapsack Problem Using Dynamic Programming - Design and Analysis of Algorithms
Learn to solve the 0/1 Knapsack problem using dynamic programming. Master this classic algorithm optimization technique for efficient decision-making in resource allocation scenarios.
0/1 Knapsack Problem Using FIFO Branch and Bound - Design and Analysis of Algorithms
Comprehensive tutorial on solving the 0/1 Knapsack problem using FIFO Branch and Bound method, with practical examples and step-by-step explanations for efficient algorithm implementation.
0/1 Knapsack Problem Using Least Cost Branch and Bound - Design and Analysis of Algorithms
Learn to solve the 0/1 Knapsack problem using Least Cost Branch and Bound method, with a step-by-step example demonstrating the algorithm's application in Design and Analysis of Algorithms.
Fast Exact Algorithms for Interdiction Problems - Coffee Talk
Explore fast exact algorithms for interdiction problems, focusing on knapsack and minimum spanning tree variants. Learn about Stackelberg games and branch-and-bound techniques for optimization.
Contextual Stochastic Bandits with Budget Constraints and Fairness Application
Explore contextual stochastic bandits, budget constraints, and fairness applications in machine learning. Learn strategies for balancing exploration and exploitation in reward maximization.