Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Friday, October 4, 2019 1:00 PM EDT
Title: Greedy Heuristic for Maximizing Submodular Set Functions
Speaker: Ishan Bansal Affiliation: University of Waterloo Room: MC 5417Abstract:
Several hard combinatorial optimization problems can be posed in the following framework: maximize a submodular function over its domain subject to a cardinality constraint.
Friday, October 4, 2019 3:30 PM EDT
Title: Extending drawings of K(n) to pseudolines and pseudocircles
Speaker: Bruce Richter Affiliation: University of Waterloo Room: MC 5501Abstract:
In the early part of the 21st century, it was shown that the number of crossings in a straight-line drawing of K(n) is at least the number H(n), which is conjectured to be the crossing number of K(n). In fact, it is now known that, for n at least 10, the inequality is strict.