Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Approximation Algorithms

Showing: 100 courses
NPTEL

Design & Analysis of Algorithms

1 rewiews
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Add to list
34 Lesons
1 day 6 hours
On-Demand
Free-Video
NPTEL

Design and Analysis of Algorithms

0 rewiews
Comprehensive exploration of algorithm design techniques, analysis frameworks, and problem-solving strategies, covering divide-and-conquer, greedy algorithms, dynamic programming, and NP-completeness.
Add to list
34 Lesons
1 day 6 hours
On-Demand
Free-Video
NPTEL

Computer Algorithms - 2

0 rewiews
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.
Add to list
35 Lesons
1 day 6 hours
On-Demand
Free-Video
Linux Foundation

Building an Open Source Streaming Analytics Stack with Kafka and Druid

0 rewiews
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.
Add to list
24 Lesons
41 minutes
On-Demand
Free-Video
Finnish Center for Artificial Intelligence FCAI

Coresets for Robust Submodular Maximization with Deletions

0 rewiews
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.
Add to list
13 Lesons
39 minutes
On-Demand
Free-Video
Ryan O'Donnell

Goemans-Williamson: Rounding the Max-Cut SDP - Lecture 20a of CS Theory Toolkit

0 rewiews
Efficient algorithm for approximating maximum graph cuts using semidefinite programming and randomized rounding, with guaranteed performance ratio of 0.878.
Add to list
7 Lesons
32 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Constant Girth Approximation for Directed Graphs in Subquadratic Time

0 rewiews
Explore subquadratic-time algorithms for approximating constant girth in directed graphs, covering ball growing techniques, random sampling, and combined approaches for efficient graph analysis.
Add to list
10 Lesons
22 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Viswanath Nagarajan - Stochastic Load Balancing on Unrelated Machines

0 rewiews
Explores stochastic load balancing on unrelated machines, presenting a constant factor approximation algorithm for minimizing expected makespan. Discusses LP relaxation and rounding techniques.
Add to list
21 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Andreas E. Feldmann - A -embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

0 rewiews
Explores embedding low highway dimension graphs into bounded treewidth graphs, with applications in transportation network optimization problems like Travelling Salesman and Facility Location.
Add to list
22 Lesons
27 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Reassembling Trees for the Traveling Salesman

0 rewiews
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
Add to list
8 Lesons
31 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

On Element Connectivity Preserving Graph Simplification

0 rewiews
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.
Add to list
26 Lesons
46 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems - Lecture II

0 rewiews
Explore advanced approximation algorithms for network design, focusing on connectivity augmentation problems and recent developments in combinatorial optimization techniques.
Add to list
1 Lesons
1 hour 20 minutes
On-Demand
Free-Video
Simons Institute

Dynamic Algorithms for Center on Graphs

0 rewiews
Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
IEEE

The Complexity of Approximating Averages on Bounded-Degree Graphs

0 rewiews
Explore the intricacies of approximating averages on bounded-degree graphs, delving into computational complexities and algorithmic approaches.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Dynamic PageRank: Additive Error and Batch Recomputation

0 rewiews
Explores dynamic PageRank algorithms, proving hardness of relative error approximations and demonstrating efficiency of batch recomputation for L1 error metric in dynamic graph settings.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Simons Institute

Sparsifying Set Systems for Coverage Problems

0 rewiews
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

Improved Streaming Algorithms for Max-DICUT via Local Snapshots

0 rewiews
Explore advanced streaming algorithms for Max-DICUT problem, focusing on local graph snapshots to surpass the 4/9 approximation in sublinear space.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Simons Institute

Approximating Maximum Matching Requires Almost Quadratic Time

0 rewiews
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.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Online Algorithms for Spectral Hypergraph Sparsification

0 rewiews
Explore online algorithms for spectral hypergraph sparsification, focusing on space-efficient methods for handling streaming hyperedges and producing accurate sparsifiers.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
Simons Institute

On (1 + ε)-Approximate (Vertex) Cut Sparsifiers

0 rewiews
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.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Simons Institute

Stochastic Minimum Vertex Cover with Few Queries: A 3/2-Approximation

0 rewiews
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.
Add to list
1 Lesons
30 minutes
On-Demand
Free-Video
Simons Institute

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

0 rewiews
Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Simons Institute

New Algorithms for Directed Spanner Problems and Generalizations

0 rewiews
Explore recent advancements in directed spanner algorithms, including online and offline settings, weighted variants, and buy-at-bulk extensions.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers

0 rewiews
Explore approaches for designing fast dynamic algorithms for approximate matchings, focusing on fully dynamic settings and the concept of matching sparsifiers in graph theory.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Simons Institute

Maximum Matching in O(log log n) Passes in Dynamic Streams

0 rewiews
Explore an algorithm for approximating maximum matching in dynamic streams, achieving O(1)-approximation in O(log log n) passes and O(n poly log n) space, with lower bound proof.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
Simons Institute

Toward Optimal Semi-streaming Algorithm for (1+ε)-Approximate Maximum Matching

0 rewiews
Explore a deterministic algorithm for (1+ε)-approximate maximum matching, improving pass-complexity and advancing solutions in various computational models.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
Simons Institute

Cut Sparsification and Succinct Representation of Submodular Hypergraphs

0 rewiews
Explore cut sparsification of hypergraphs, focusing on submodular functions. Learn about new bounds, polynomial bounds, and succinct representation techniques for various submodular function families.
Add to list
1 Lesons
37 minutes
On-Demand
Free-Video
Simons Institute

The Approximate Structure of Triangle-Free Graphs

0 rewiews
Explore the structure of dense triangle-free graphs and learn about efficient algorithms for computing their approximate representations using smaller graphs.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

Sketching Techniques for Data Structures and Optimization - Part 2

0 rewiews
Explore advanced sketching techniques for data structures and optimization in fast algorithms, focusing on practical applications and theoretical foundations.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Simons Institute

Sketching Techniques for Data Structures and Optimization - Part 1

0 rewiews
Explore data structure optimization techniques for fast algorithms, focusing on sketching methods to enhance computational efficiency and performance.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Squid: Schools for Quantum Information Development

An Improved Quantum Max Cut Approximation via Maximum Matching

0 rewiews
Discover groundbreaking improvements in Quantum Max Cut approximation through maximum matching techniques, achieving a 0.595 approximation ratio using simplified 2-qubit state outputs.
Add to list
1 Lesons
16 minutes
On-Demand
Free-Video
Simons Institute

A Brief Introduction to Algorithms, Game Theory and Risk-Averse Decision Making

0 rewiews
Explore algorithms, game theory, and risk-averse decision making, covering shortest paths, NP-Complete problems, equilibria, and various risk frameworks for real-world applications.
Add to list
27 Lesons
1 hour 12 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Breaching the 2-Approximation Barrier for Connectivity Augmentation

0 rewiews
Explore connectivity augmentation, including incident links, Steiner tree reduction, and approximation algorithms. Learn about recent advances and open problems in this field.
Add to list
19 Lesons
22 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems - Lecture III

0 rewiews
Explore advanced network design techniques for increasing graph connectivity, focusing on recent approaches and advances in augmentation problems like Tree Augmentation and Connectivity Augmentation.
Add to list
9 Lesons
1 hour 18 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Randomized Composable Core-Sets for Submodular Maximization

0 rewiews
Explores randomized composable core-sets for distributed submodular and diversity maximization, presenting improved algorithms and analysis techniques for big data optimization problems.
Add to list
14 Lesons
33 minutes
On-Demand
Free-Video
Simons Institute

PCPs and Global Hyper-contractivity - Lecture 1

0 rewiews
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
Simons Institute

PCPs and Global Hyper-contractivity - Lecture 2

0 rewiews
Explore advanced concepts in PCPs and global hyper-contractivity with Dor Minzer, delving into complex mathematical theories and their applications in analysis and theoretical computer science.
Add to list
1 Lesons
1 hour 4 minutes
On-Demand
Free-Video
Simons Institute

PCPs and Global Hyper-contractivity - Lecture 1

0 rewiews
Explore advanced concepts in theoretical computer science, focusing on Probabilistically Checkable Proofs and global hyper-contractivity with expert Dor Minzer.
Add to list
1 Lesons
50 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Approximation Algorithms

0 rewiews
Explore approximation algorithms for network design, including connectivity augmentation, Steiner trees, and spectral rounding techniques. Learn about linear programming and future research directions.
Add to list
16 Lesons
41 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

0 rewiews
Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.
Add to list
14 Lesons
40 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

An Improved Approximation Algorithm for ATSP

0 rewiews
Explore an advanced approximation algorithm for the Asymmetric Traveling Salesman Problem, covering linear programming relaxation, reductions, and recursive techniques to improve solution quality.
Add to list
11 Lesons
24 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Breaching the 2-Approximation Barrier for Connectivity Augmentation

0 rewiews
Explore advanced techniques in network design, focusing on connectivity augmentation and its reduction to the Steiner Tree problem. Learn about novel approximation algorithms and open challenges in the field.
Add to list
17 Lesons
20 minutes
On-Demand
Free-Video
Simons Institute

A Slightly Improved Approximation Algorithm for Metric TSP

0 rewiews
Explore an improved approximation algorithm for the Metric Traveling Salesman Problem, focusing on 2-uniform spanning trees and probabilistic techniques in algorithm design.
Add to list
21 Lesons
46 minutes
On-Demand
Free-Video
Simons Institute

Crash Course on Probabilistically Checkable Proofs - Introduction

0 rewiews
Explore probabilistically checkable proofs, including recoloring, constraint satisfaction, and the PCP theorem. Learn about verifier parameters and hardness of approximation in this comprehensive introduction.
Add to list
12 Lesons
1 hour 1 minute
On-Demand
Free-Video
Fields Institute

Approximation Algorithms for Hitting Subgraphs

0 rewiews
Explore approximation algorithms for hitting subgraphs, covering inapproximability, NP-hardness, and semi-symmetric cut vertices in this advanced combinatorial algorithms lecture.
Add to list
9 Lesons
29 minutes
On-Demand
Free-Video
Simons Institute

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

0 rewiews
Explores NP-hardness of approximating meta-complexity using cryptographic constructions, focusing on near-optimal results for Minimum Oracle Circuit Size Problem and its implications.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Simple and Fast Rounding Algorithms for Directed and Node Weighted Multiway Cut

0 rewiews
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.
Add to list
1 Lesons
27 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

A 1.5-Approximation for Path TSP

0 rewiews
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.
Add to list
1 Lesons
1 hour 16 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Recent Hardness of Approximation Results in Parameterized Complexity

0 rewiews
Survey of recent hardness of approximation results in parameterized complexity, focusing on k-clique problem inapproximability, with technical insights and open problems discussion.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

LP-Norm Multiway Cut

0 rewiews
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.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems

0 rewiews
Explore advanced network design techniques for increasing graph connectivity, focusing on augmentation problems and recent developments in combinatorial optimization.
Add to list
1 Lesons
1 hour 12 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Computational Complexity in Theory and in Practice by Richard M. Karp

0 rewiews
Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.
Add to list
1 Lesons
1 hour 17 minutes
On-Demand
Free-Video
Paul G. Allen School

Money, Circuits, Mythic Figures, and More - Theory in the Allen School

0 rewiews
Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.
Add to list
19 Lesons
53 minutes
On-Demand
Free-Video
Ryan O'Donnell

Hardness of Approximation - Part 1

0 rewiews
Explore hardness of approximation in computational complexity, covering Max Cut, Independent Set, and K-Cover problems. Learn key definitions, algorithms, and current research state.
Add to list
17 Lesons
59 minutes
On-Demand
Free-Video
Ryan O'Donnell

Approximation Algorithms

0 rewiews
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.
Add to list
29 Lesons
1 hour 14 minutes
On-Demand
Free-Video
Ryan O'Donnell

Great Ideas in Theoretical Computer Science - Approximation Algorithms

0 rewiews
Explore approximation algorithms for NP-hard problems, focusing on Vertex Cover, k-Coverage, and Traveling Salesperson. Learn techniques to find near-optimal solutions efficiently.
Add to list
25 Lesons
1 hour 20 minutes
On-Demand
Free-Video
Ryan O'Donnell

Analysis of Boolean Functions at CMU - Constraint Satisfaction Problems

0 rewiews
Explore constraint satisfaction problems in boolean functions, covering topics like Max3SAT, Max3Coloring, and approximation algorithms for complex computational challenges.
Add to list
13 Lesons
1 hour 15 minutes
On-Demand
Free-Video
IEEE

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization

0 rewiews
Explore advanced techniques for solving stochastic minimum norm combinatorial optimization problems, focusing on approximation algorithms and their applications in complex decision-making scenarios.
Add to list
1 Lesons
22 minutes
On-Demand
Free-Video
IEEE

Pandora's Box with Correlations - Learning and Approximation

0 rewiews
Explore learning and approximation techniques for correlated Pandora's Box problems, focusing on algorithmic approaches and theoretical insights.
Add to list
1 Lesons
20 minutes
On-Demand
Free-Video
IEEE

Approximation Algorithms for LCS and LIS with Truly Improved Running Times

0 rewiews
Explore advanced approximation algorithms for LCS and LIS, offering improved running times and enhanced computational efficiency in sequence analysis.
Add to list
1 Lesons
18 minutes
On-Demand
Free-Video
IEEE

Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries

0 rewiews
Explore approximation schemes for unit-demand buyers using symmetries, focusing on independent items and their implications in algorithmic game theory and mechanism design.
Add to list
1 Lesons
21 minutes
On-Demand
Free-Video
Simons Institute

Algorithmic Mechanism Design with Investment

0 rewiews
Explore approximation algorithms for knapsack problems, focusing on allocation efficiency and investment incentives in mechanism design without confirming negative externalities.
Add to list
1 Lesons
49 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Time Algorithms for Estimating Edit Distance

0 rewiews
Explore efficient methods for approximating edit distance between strings, focusing on sublinear time algorithms and their applications in computational biology and text processing.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Simons Institute

Coresets and Their Applications to Design Sublinear Algorithms

0 rewiews
Explore coresets and their role in designing efficient sublinear algorithms, enhancing computational performance for large-scale data analysis and machine learning tasks.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
Simons Institute

Parameterized Inapproximability of the Minimum Distance Problem over All Fields

0 rewiews
Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
ACM SIGPLAN

ReLU Hull Approximation - Fast and Precise Convex Hull Over-Approximation for Neural Network Verification

0 rewiews
Explore a fast, precise approach to over-approximating ReLU function convex hulls in neural network verification, improving efficiency and precision for large-scale networks.
Add to list
1 Lesons
18 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

0 rewiews
Explore random walks on graphs to achieve better-than-1/2 approximation for max-cut on expanding and clusterable graphs, using sublinear time algorithms.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
Simons Institute

Sublinear-Time Algorithms in Learning

0 rewiews
Explore cutting-edge sublinear algorithms for efficient machine learning, focusing on extroverted approaches and their applications in large-scale data analysis.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance

0 rewiews
Explore advancements in nearest neighbor search for Earth Mover's Distance, improving approximation to Õ(log s) with sublinear query time using data-dependent LSH functions and tree embedding techniques.
Add to list
1 Lesons
37 minutes
On-Demand
Free-Video
Simons Institute

Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree

0 rewiews
Efficient distributed algorithms for clustering high-dimensional data using Euclidean Minimum Spanning Tree, achieving constant factor approximation in O~(loglogn) rounds of MPC model.
Add to list
1 Lesons
28 minutes
On-Demand
Free-Video
Simons Institute

Applications of Sub-linear Algorithms in Other Fields

0 rewiews
Explore how sub-linear algorithms impact diverse fields, enhancing efficiency and scalability in data analysis and problem-solving across disciplines.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
IEEE

Inapproximability of Clustering in Lp Metrics

0 rewiews
Explores computational complexity of clustering in Lp metrics, discussing approximation algorithms, hardness of approximation, and key concepts like Johnson Coverage Hypothesis.
Add to list
17 Lesons
21 minutes
On-Demand
Free-Video
IEEE

Towards Better Approximation of Graph Crossing Number

0 rewiews
Explores advanced techniques for approximating graph crossing numbers, focusing on new frameworks and theorems for both general and bounded-degree graphs.
Add to list
10 Lesons
26 minutes
On-Demand
Free-Video
IEEE

Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT

0 rewiews
Explore streaming approximations for Boolean Max 2-CSPs and Max k-SAT, covering algorithms, lower bounds, and communication complexity in constraint satisfaction problems.
Add to list
15 Lesons
25 minutes
On-Demand
Free-Video
IEEE

On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs

0 rewiews
Explore efficient graph traversal techniques using light spanners and low-treewidth embeddings, with applications to minor-free graphs and approximation algorithms.
Add to list
16 Lesons
24 minutes
On-Demand
Free-Video
IEEE

Stochastic Weighted Matching - 1-Epsilon Approximation

0 rewiews
Explore stochastic weighted matching algorithms, including Monte Carlo analysis, vertex-independent matching, and greedy approaches for efficient approximation solutions.
Add to list
11 Lesons
29 minutes
On-Demand
Free-Video
IEEE

A Parameterized Approximation Scheme for Min k-Cut

0 rewiews
Explore a parameterized approximation scheme for the Min k-Cut problem, covering algorithms, research directions, and proof ingredients like tree decomposition and polynomial time analysis.
Add to list
12 Lesons
21 minutes
On-Demand
Free-Video
IEEE

Cut-Equivalent Trees are Optimal for Min-Cut Queries

0 rewiews
Explore cut-equivalent trees and their optimality for min-cut queries, covering algorithms, data structures, and approximation techniques in graph theory.
Add to list
12 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Algorithms and Complexity Theory Vignettes

0 rewiews
Explore key concepts and applications of sublinear algorithms through practical vignettes, focusing on efficient computational methods and algorithmic complexity.
Add to list
1 Lesons
14 minutes
On-Demand
Free-Video
Squid: Schools for Quantum Information Development

Improved Approximations for Extremal Eigenvalues of Sparse Hamiltonians

0 rewiews
Discover advanced approximation techniques for eigenvalues in sparse Hamiltonians, exploring new methods for quantum systems with q-local terms and improved mathematical approaches for k-sparse configurations.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
ACM SIGPLAN

A Better Approximation for Interleaved Dyck Reachability

0 rewiews
Explore a novel approach to interleaved Dyck reachability, offering improved precision for context- and field-sensitive static analyses through refined CFLs and on-demand application.
Add to list
1 Lesons
17 minutes
On-Demand
Free-Video
Simons Institute

Local Algorithms: Principles and Applications

0 rewiews
Explore insights from Tal Herman's presentation at the Workshop on Local Algorithms, delving into cutting-edge research in computer science and mathematics.
Add to list
1 Lesons
25 minutes
On-Demand
Free-Video
Institute for Advanced Study

How Efficiently Can We Solve Unique Games? - Lecture

0 rewiews
Explore the computational complexity of Unique Games and their efficient solutions in this insightful talk by Yotam Dikstein.
Add to list
1 Lesons
16 minutes
On-Demand
Free-Video
Simons Institute

Almost-Optimal Sublinear Additive Spanners in Graph Theory

0 rewiews
Explore sublinear additive spanners in graph theory, focusing on optimal stretch functions and size bounds for undirected unweighted graphs. Learn about recent advancements and their implications.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Algorithms for Correlation Clustering

0 rewiews
Explore sublinear algorithms for correlation clustering, focusing on a 3+eps approximation method using LCA probes, MPC rounds, and dynamic updates. Analyze technical results for maximal independent set computation.
Add to list
1 Lesons
50 minutes
On-Demand
Free-Video
Simons Institute

A Quasi-Monte Carlo Algorithm for Smooth Kernel Evaluation

0 rewiews
Explore a novel data structure for density queries, combining discrepancy theory and LSH to build sparse coresets and enhance smooth kernel evaluation algorithms.
Add to list
1 Lesons
42 minutes
On-Demand
Free-Video
Institut des Hautes Etudes Scientifiques (IHES)

Euclidean Capacitated Vehicle Routing in Random Setting - A 1.55-Approximation Algorithm

0 rewiews
Explore a 1.55-approximation algorithm for Euclidean capacitated vehicle routing in random settings, presented by Zipei Nie.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
PapersWeLove

Bin Packing Can Be Solved Within 1 + ε in Linear Time - Lecture

0 rewiews
Explore bin packing optimization with Yiduo Ke, delving into a linear-time solution within 1 + ε. Gain insights into this fundamental problem's applications and theoretical advancements.
Add to list
1 Lesons
36 minutes
On-Demand
Free-Video
Google TechTalks

A Nearly Tight Analysis of Greedy k-means++

0 rewiews
Explore the greedy k-means++ algorithm's performance, analyzing its approximation guarantees and comparing it to the original k-means++ method for solving the k-means problem.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
Google TechTalks

A Constant Factor Prophet Inequality for Online Combinatorial Auctions

0 rewiews
Explore constant factor prophet inequalities for online combinatorial auctions with subadditive valuations. Learn about the Mirror Lemma and Kakutani's fixed point theorem application.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
Google TechTalks

One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees and Strong Sparse Partition Hierarchies

0 rewiews
Explore polylogarithmic universal Steiner trees and strong sparse partition hierarchies. Learn about new constructions improving approximation guarantees and matching logarithmic lower bounds.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video
Google TechTalks

A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization

0 rewiews
Explore multi-buyer multi-item sequential pricing mechanisms for revenue maximization, focusing on approximating ex ante optimal revenue for subadditive buyers through a new multi-dimensional Online Contention Resolution Scheme.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
USC Probability and Statistics Seminar

Online k-means Clustering on Arbitrary Data Streams - Lecture

0 rewiews
Explore online k-means clustering for arbitrary data streams, focusing on a novel algorithm with polynomial space and time complexity and provable guarantees without input assumptions.
Add to list
16 Lesons
37 minutes
On-Demand
Free-Video
Institut Henri Poincaré

New Directions in Correlation Clustering and Biclustering

0 rewiews
Explore advanced techniques in correlation clustering and biclustering, focusing on novel approaches and applications in data analysis and machine learning.
Add to list
1 Lesons
37 minutes
On-Demand
Free-Video
Simons Institute

Optimal Quantile Estimation for Streams

0 rewiews
Explore optimal quantile estimation for data streams, focusing on space-efficient algorithms and recent advancements in deterministic sketching techniques for improved accuracy and memory usage.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Simons Institute

A Bi-metric Framework for Fast Similarity Search

0 rewiews
Explore a novel bi-metric framework for efficient nearest neighbor search, combining accurate but costly ground-truth metrics with faster proxy metrics to optimize data structures and query procedures.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Institute for Advanced Study

Quasi-Linear Size PCPs with Small Soundness from High-Dimensional Expanders

0 rewiews
Delve into probabilistically checkable proofs (PCPs), exploring their encoding, verification, and applications in computer science, with focus on achieving small soundness using high-dimensional expanders.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
BIMSA

Classic Problems with Modern Techniques - Prize-collecting Framework

0 rewiews
Explore state-of-the-art approximation algorithms for classic network design problems using modern techniques, from clustering to recursive methodologies.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

An Optimal Space Lower Bound for Approximating MAX-CUT

0 rewiews
Delve into advanced Fourier analysis techniques for boolean cube applications and discover how they reveal optimal space complexity bounds for MAX-CUT approximation algorithms.
Add to list
1 Lesons
1 hour 11 minutes
On-Demand
Free-Video
Centrum Fizyki Teoretycznej PAN

Better Bounds on Grothendieck Constants of Finite Orders

0 rewiews
Delve into advanced mathematical research exploring Grothendieck constants, their optimization applications, and connections to quantum mechanics through improved computational approaches and theoretical analysis.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video