A Slightly Improved Approximation Algorithm for Metric TSP
Explore an improved approximation algorithm for the Metric Traveling Salesman Problem, focusing on 2-uniform spanning trees and probabilistic techniques in algorithm design.
Crash Course on Probabilistically Checkable Proofs - Introduction
Explore probabilistically checkable proofs, including recoloring, constraint satisfaction, and the PCP theorem. Learn about verifier parameters and hardness of approximation in this comprehensive introduction.
Approximation Algorithms for Hitting Subgraphs
Explore approximation algorithms for hitting subgraphs, covering inapproximability, NP-hardness, and semi-symmetric cut vertices in this advanced combinatorial algorithms lecture.
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Explores NP-hardness of approximating meta-complexity using cryptographic constructions, focusing on near-optimal results for Minimum Oracle Circuit Size Problem and its implications.
Simple and Fast Rounding Algorithms for Directed and Node Weighted Multiway Cut
Explore efficient algorithms for directed and node-weighted multiway cut problems, focusing on simple rounding techniques and integrality gap analysis in graph theory and combinatorial optimization.
A 1.5-Approximation for Path TSP
Explores a 1.5-approximation algorithm for the Metric Path Traveling Salesman Problem, introducing novel techniques to handle larger s-t cuts and achieve a simplified approach matching Christofides' TSP algorithm.
Recent Hardness of Approximation Results in Parameterized Complexity
Survey of recent hardness of approximation results in parameterized complexity, focusing on k-clique problem inapproximability, with technical insights and open problems discussion.
LP-Norm Multiway Cut
Explores graph partitioning with lp-norm multiway cut, unifying min-sum and min-max variants. Discusses hardness, integrality gap, and approximation algorithm for this generalized problem.
Approximation Algorithms for Hard Augmentation Problems
Explore advanced network design techniques for increasing graph connectivity, focusing on augmentation problems and recent developments in combinatorial optimization.
Computational Complexity in Theory and in Practice by Richard M. Karp
Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.
Money, Circuits, Mythic Figures, and More - Theory in the Allen School
Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.
Hardness of Approximation - Part 1
Explore hardness of approximation in computational complexity, covering Max Cut, Independent Set, and K-Cover problems. Learn key definitions, algorithms, and current research state.
Approximation Algorithms
Explore approximation algorithms for NP-hard problems, focusing on vertex cover, k-coverage, and traveling salesperson. Learn greedy approaches and their limitations, as well as more advanced techniques.
Great Ideas in Theoretical Computer Science - Approximation Algorithms
Explore approximation algorithms for NP-hard problems, focusing on Vertex Cover, k-Coverage, and Traveling Salesperson. Learn techniques to find near-optimal solutions efficiently.
Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems
Explore constraint satisfaction problems in boolean functions, covering topics like Max3SAT, Max3Coloring, and approximation algorithms for complex computational challenges.
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
Explore advanced techniques for solving stochastic minimum norm combinatorial optimization problems, focusing on approximation algorithms and their applications in complex decision-making scenarios.
Pandora's Box with Correlations - Learning and Approximation
Explore learning and approximation techniques for correlated Pandora's Box problems, focusing on algorithmic approaches and theoretical insights.
Approximation Algorithms for LCS and LIS with Truly Improved Running Times
Explore advanced approximation algorithms for LCS and LIS, offering improved running times and enhanced computational efficiency in sequence analysis.
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
Explore approximation schemes for unit-demand buyers using symmetries, focusing on independent items and their implications in algorithmic game theory and mechanism design.
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.
Sublinear Time Algorithms for Estimating Edit Distance
Explore efficient methods for approximating edit distance between strings, focusing on sublinear time algorithms and their applications in computational biology and text processing.