Combinatorial Optimization - Trimester Program Lectures

Hausdorff Center for Mathematics via YouTube

Start learning Write review

Explore advanced topics in combinatorial optimization through this comprehensive collection of conference talks delivered during a trimester program at the Hausdorff Research Institute for Mathematics. Delve into cutting-edge research presentations covering discrete convex analysis, submodular function optimization, approximation algorithms, graph connectivity problems, and game theory applications. Learn from leading experts as they present their latest findings on topics including semidefinite programming, matroid theory, network design, matching problems, and computational complexity. Discover new algorithmic approaches for solving classical optimization problems such as the traveling salesman problem, maximum satisfiability, and various graph augmentation challenges. Examine theoretical foundations and practical applications of polynomial optimization hierarchies, rigidity theory, and equilibrium computation in multi-player games. Gain insights into smoothed analysis techniques, streaming algorithms for large-scale optimization, and the interplay between discrete mathematics and operations research. Access detailed presentations on specialized topics including nucleolus computation in cooperative games, privacy-preserving mechanisms, and supply chain optimization models.

Syllabus

Kazuo Murota: Discrete Convex Analysis (Part 1)
James Lee: Semi Definite Extended Formulations and Sums of Squares (Part 1)
Matthias Mnich: Improved Approximation Algorithm for Minimum Feedback Vertex Sets in Tournaments
Jonas Witt: Dantzig Wolfe Reformulations for the Stable Set Problem
Yin Tat Lee & Aaron Sidford: Faster Cutting Plane Methods and Improved Running Times for Submodular
Victor Chepoi: Simple connectivity, local to global, and matroids
Heiko Röglin: Smoothed Analysis of Algorithms (Part 1)
Kazuo Murota: Discrete Convex Analysis (Part 2)
Tasuku Soma: Maximizing Monotone Submodular Functions over the Integer Lattice
Kent Quanrud: Streaming Algorithms for Submodular Function Maximization
Vivek Madan: Simple and fast rounding algorithms for directed and node weighted multiway cut
Matthias Poloczek: New Approximation Algorithms for MAX SAT Simple, Fast, and Excellent in Practice
Chandra Chekuri: On element connectivity preserving graph simplification
Anupam Gupta: The Independent Set problem on Degree d Graphs
Sahil Singla: Online Matroid Intersection Beating Half for Random Arrival
Linda Farczadi: The nucleolus of matching games
Rico Zenklusen: An O(1)-approximation for minimum spanning tree interdiction
Jens Vygen: Reassembling trees for the traveling salesman
Kazuo Murota: Extensions and Ramifications of Discrete Convexity Concepts
Deeparnab Chakrabarty: Provable Submodular Function Minimization via Fujishige Wolfe Algorithm
Aravind Srinivasan: Approximating integer programming problems by partial resampling
Kazuo Murota: Discrete Convex Analysis (Part 3)
Agnes Cseh: Popular matchings
Laurence Wolsey: A polyhedral approach to the maximum convex subset problem in 2-d
Robert Weismantel: Affine TU decomposition of matrices
András Frank: Non TDI Optimization with Supermodular Functions
Monique Laurent: Convergence analysis of hierarchies for polynomial optimization
Ahmad Abdi: Packing odd T-joins with at most two terminals
Zoltán Szigeti: Connectivity Problems (Part 1)
Chaitanya Swamy: Signaling in Bayesian Games
Wolfgang Mader: Critical vertices in k connected digraphs
Yuval Filmus: Monotone Submodular Optimization over a Matroid
Rico Zenklusen: The Submodular Secretary Problem Goes Linear
Rahul Savani: Polymatrix Games Algorithms and Applications
Standa Zivny: The Power of Sherali Adams Relaxations for General Valued CSPs
Volker Kaibel: A simple geometric proof showing that almost all 01 polytopes have exponential ...
Anja Fischer: Polynomial Matroid Optimisation Problems
Zeev Nutov: On LP-relaxations for the tree augmentation problem
Alexander Schrijver: The partially disjoint paths problem
Seffi Naor: Recent Results on Maximizing Submodular Functions
Andreas E. Feldmann: A (1+ε)-embedding of low highway dimension graphs into bounded treewidth graphs
Alina Ene: The Power of Randomization Distributed Submodular Maximization on Massive Datasets
Shin-ichi Tanigawa: Sufficient Conditions for Unique Graph Realizations
András Sebő: Travelling salesmen on bounded degree trails
Dominik Peters: Structural Tractability in Hedonic Games
Ruta Mehta: A Market for Scheduling, with Applications to Cloud Computing
Vahab Mirrokni: Coordination Mechanisms and Price of Anarchy via Fenchel Duality
Kousha Etessami: The complexity of computing a quasi perfect equilibrium for n player extensive form
Edith Elkind: Coalitional Games on Sparse Social Networks
Marco Di Summa: Cut generating functions
Chidambaram Annamalai: Finding Perfect Matchings in Bipartite Hypergraphs
Monaldo Mastrolilli: On some easy problems that are hard for the Lasserre hierarchy
Jon Lee: Comparing polyhedral relaxations via volume
Christos Kalaitzis: Approximating the Maximum Budgeted Allocation Problem using the Configuration LP
Rachel Cummings: The Strange Case of Privacy in Equilibrium Models
Akiyoshi Shioura: Analysis of L-convex Function Minimization Algorithms and App. to Auction Th.
Gyula Pap: Linear matroid matching in the oracle model
Jørgen Bang-Jensen: Antistrong digraphs
Viswanath Nagarajan: Approximation Friendly Discrepancy Rounding
M. Zadimoghaddam: Randomized Composable Core-sets for Submodular Maximization
Niv Buchbinder: Deterministic Algorithms for Submodular Maximization Problems
Parinya Chalermsook: Graph products, hardness of approximation, and beyond
Yun Kuen (Marco) Cheung: Asynchronous Tatonnement and Coordinate Descent
Satoru Fujishige: Combinatorial Polynomial Algorithms for Skew bisubmodular Function Minimization
Tamás Király: Blocking optimal k arborescences
Tom McCormick: Discrete Convexity in Supply Chain Models
Ramamoorthi Ravi: Designing Overlapping Networks for Publish Subscribe Systems
Zoltán Szigeti: On (2k,k)-connected graphs
Tony Nixon: Rigidity of Graphs on Expanding Spheres
Louis Theran: Rigidity of Random Graphs in Higher Dimensions
Heiko Röglin: Smoothed Analysis of Algorithms (Part 2)
Jugal Garg: ETR Completeness for Decision Versions of Multi Player Symmetric Nash Equilibria
Agnes Cseh: Paths to stable allocations
Yusuke Kobayashi: Restricted 2 matchings and Discrete Convexity
Heiko Röglin: Smoothed Analysis of Algorithms (Part 3)
James Lee: Semi Definite Extended Formulations and Sums of Squares (Part 3)
Csaba Király: Rigid Graphs and an Augmentation Problem
James Lee: Semi Definite Extended Formulations and Sums of Squares (Part 2)
Zoltán Szigeti: Connectivity Problems (Part 3)
Bill Jackson: Generic Rigidity of Point Line Frameworks
Bernd Schulze: Characterizing Minimally Flat Symmetric Hypergraphs
Zoltán Szigeti: Connectivity Problems (Part 2)
Troels Bjerre Lund: Timeabillity of Extensive-Form Games
Tamás Király: Complexity of finding equilibria in linear service providing games