Welcome to Combinatorics and Optimization
Spring 2018 Undergraduate Research Assistantship Program (URA). Applications for the Spring 2018 program are now closed.
Sergey Norin - November 2
*Recordings of occurred talks are all available on C&O's YouTube Channel.
New Deadline: February 1, '19
- Oct. 18, 2018
Written by Institute for Quantum Computing staff
Quantum computers can solve a linear algebra problem faster than classical computers, according to a new study published in Science. The finding proves that constant-depth quantum circuits are more powerful than their classical counterparts, and provides a new sense of how quantum technology will be a key to more powerful computing.
- Aug. 17, 2018
Professor Jochen Koenemann is a co-organizer of a followup workshop to the 2015 Trimester Program on Combinatorial Optimization.
- Aug. 1, 2018
On August 1, David Gosset joined the Department of Combinatorics and Optimization as an Associate Professor.
- Oct. 19, 2018
Title: Primal-dual and Lagrangian relaxation techniques for k-median
Speaker: Madison Van Dyk Affiliation: University of Waterloo Room: MC 5479
Abstract: We will develop primal-dual algorithms to obtain constant-factor approximations for the uncapacitated facility location problem.
- Oct. 19, 2018
Title: New algorithms for maximum disjoint paths based on tree-likeness
Speaker: Matthias Mnich Affiliation: University of Bonn Room: MC 5501
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph.
- Oct. 25, 2018
Title: Maximum Independent Sets in Erdos-Ko-Rado Combinatorics
Speaker: Nathan Lindzey Affiliation: University of Waterloo Room: MC 6486
Abstract: We discuss a general algebraic method for characterizing maximum independent sets in graphs that arise in Erdos-Ko-Rado combinatorics, provided the graphs are large enough.