Sublinear Algorithms for Correlation Clustering
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.
A Quasi-Monte Carlo Algorithm for Smooth Kernel Evaluation
Explore a novel data structure for density queries, combining discrepancy theory and LSH to build sparse coresets and enhance smooth kernel evaluation algorithms.
Euclidean Capacitated Vehicle Routing in Random Setting - A 1.55-Approximation Algorithm
Explore a 1.55-approximation algorithm for Euclidean capacitated vehicle routing in random settings, presented by Zipei Nie.
Bin Packing Can Be Solved Within 1 + ε in Linear Time - Lecture
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.
A Nearly Tight Analysis of Greedy k-means++
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.
A Constant Factor Prophet Inequality for Online Combinatorial Auctions
Explore constant factor prophet inequalities for online combinatorial auctions with subadditive valuations. Learn about the Mirror Lemma and Kakutani's fixed point theorem application.
One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees and Strong Sparse Partition Hierarchies
Explore polylogarithmic universal Steiner trees and strong sparse partition hierarchies. Learn about new constructions improving approximation guarantees and matching logarithmic lower bounds.
A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization
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.
Online k-means Clustering on Arbitrary Data Streams - Lecture
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.
New Directions in Correlation Clustering and Biclustering
Explore advanced techniques in correlation clustering and biclustering, focusing on novel approaches and applications in data analysis and machine learning.
Optimal Quantile Estimation for Streams
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.
A Bi-metric Framework for Fast Similarity Search
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.
Quasi-Linear Size PCPs with Small Soundness from High-Dimensional Expanders
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.
Classic Problems with Modern Techniques - Prize-collecting Framework
Explore state-of-the-art approximation algorithms for classic network design problems using modern techniques, from clustering to recursive methodologies.
An Optimal Space Lower Bound for Approximating MAX-CUT
Delve into advanced Fourier analysis techniques for boolean cube applications and discover how they reveal optimal space complexity bounds for MAX-CUT approximation algorithms.
Better Bounds on Grothendieck Constants of Finite Orders
Delve into advanced mathematical research exploring Grothendieck constants, their optimization applications, and connections to quantum mechanics through improved computational approaches and theoretical analysis.