Bingkai Lin - Parameterized Inapproximability: From Clique to PIH
Bingkai Lin, Nanjing University, presents "Parameterized Inapproximability: From Clique to PIH" at the DIMACS Workshop on Hardness of approximation in P held at Rutgers University on July 21-23, 2025.
Workshop webpage: http://dimacs.rutgers.edu/events/details?eID=3156
Видео Bingkai Lin - Parameterized Inapproximability: From Clique to PIH канала DIMACS CCICADA
Workshop webpage: http://dimacs.rutgers.edu/events/details?eID=3156
Видео Bingkai Lin - Parameterized Inapproximability: From Clique to PIH канала DIMACS CCICADA
Комментарии отсутствуют
Информация о видео
4 августа 2025 г. 20:11:28
00:40:49
Другие видео канала
Kasper Green Larsen - Tutorial (Part 3) - Multiphase & OMV Conjectures & Implications to Dynamic LBs
Roei Tell: Derandomization - Part 3
Kobbi Nissim - A Computer Scientist and a Legal Scholar Do the Wright Thing
Andrew Gelman - Information, Incentives, and Goals in Election Forecasts
Zhicheng Zhang - talk #2 on Quantum recursive programs
Luca Accorsi -- Guidelines for the Computational Testing of ML Approaches to VRPs
Peter Melchior - Source Separation in Astronomy with Constrained Matrix Factorization
Abiy Tasissa -- A Matrix Completion Framework for the Euclidean Distance Geometry Problem
Subhash Khot - Tutorial on Hardness of Approximation in NP
Lijie Chen: Recent Developments in Derandomization I
Jørgen Skålnes - A Branch-and-cut Embedded Matheuristic for the Inventory Routing Problem
Lecture 7: Algorithms for k-SAT
Sanyam Jain Ultra Wide Band for Contact Tracing and Social Distancing Recording
Patrick Klein -- Combinatorial Optimization enriched ML to Solve the Dynamic VRP with Time Windows
Rahul Ilango: Metacomplexity - Part 3
Zhicheng Zhang - talk #3 on Quantum recursive programs
Lecture 11: Hardness of Approximation in P, Part 1
Janani Sundaresan -- Random Order Streaming Lower Bounds for Connected Components
Fred Roosta - Newton's Method Without Smoothness or Complexity
Keynote: Renato Werneck - Last Mile Deliveries at Amazon
Eric Neyman - From Proper Scoring Rules to Max-Min Optimal Forecast Aggregation
