Design & Analysis of Algorithms
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Design and Analysis of Algorithms
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Computer Algorithms - 2
The course discusses efficient algorithms from a large number of domains. This course assumes the knowledge of data structures, the knowledge big-O notation and the concept of time and space complexity of an algorithm.
Building an Open Source Streaming Analytics Stack with Kafka and Druid
Learn to build a robust streaming analytics stack using Kafka and Druid for real-time data processing, flexible querying, and maintaining data integrity in high-volume environments.
Coresets for Robust Submodular Maximization with Deletions
Explore submodular maximization against deletions, learning about coresets and algorithms for robust optimization in data science problems. Gain insights from Nikolaj Tatti's research on streaming and offline approaches.
Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit
Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.
Constant Girth Approximation for Directed Graphs in Subquadratic Time
Explore subquadratic-time algorithms for approximating constant girth in directed graphs, covering ball growing techniques, random sampling, and combined approaches for efficient graph analysis.
Viswanath Nagarajan - Stochastic Load Balancing on Unrelated Machines
Explores stochastic load balancing on unrelated machines, presenting a constant factor approximation algorithm for minimizing expected makespan. Discusses LP relaxation and rounding techniques.
Andreas E. Feldmann - A -embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
Explores embedding low highway dimension graphs into bounded treewidth graphs, with applications in transportation network optimization problems like Travelling Salesman and Facility Location.
Reassembling Trees for the Traveling Salesman
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
On Element Connectivity Preserving Graph Simplification
Explores element-connectivity in graph simplification, focusing on reduction techniques, algorithmic results, and applications in network design. Highlights open problems and submodularity properties for faster algorithms.
Approximation Algorithms for Hard Augmentation Problems - Lecture II
Explore advanced approximation algorithms for network design, focusing on connectivity augmentation problems and recent developments in combinatorial optimization techniques.
Dynamic Algorithms for Center on Graphs
Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.
The Complexity of Approximating Averages on Bounded-Degree Graphs
Explore the intricacies of approximating averages on bounded-degree graphs, delving into computational complexities and algorithmic approaches.
Dynamic PageRank: Additive Error and Batch Recomputation
Explores dynamic PageRank algorithms, proving hardness of relative error approximations and demonstrating efficiency of batch recomputation for L1 error metric in dynamic graph settings.
Sparsifying Set Systems for Coverage Problems
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Improved Streaming Algorithms for Max-DICUT via Local Snapshots
Explore advanced streaming algorithms for Max-DICUT problem, focusing on local graph snapshots to surpass the 4/9 approximation in sublinear space.
Approximating Maximum Matching Requires Almost Quadratic Time
Explore algorithms for estimating maximum matching size, focusing on recent advancements and lower bounds. Gain insights into subquadratic time complexity and its limitations in graph theory.
Online Algorithms for Spectral Hypergraph Sparsification
Explore online algorithms for spectral hypergraph sparsification, focusing on space-efficient methods for handling streaming hyperedges and producing accurate sparsifiers.
On (1 + ε)-Approximate (Vertex) Cut Sparsifiers
Explore advanced graph compression techniques for planar and quasi-bipartite graphs, focusing on high-quality cut sparsifiers and their size bounds. Analyze contraction-based approaches and their limitations.
Stochastic Minimum Vertex Cover with Few Queries: A 3/2-Approximation
Explore a 3/2-approximation algorithm for stochastic vertex cover using O(n/p) non-adaptive queries, improving upon previous 2-approximation methods and discussing extensions to correlated edge realizations.