Title: The chance-constrained vehicle routing problem
| Speaker: | Ricardo Fukasawa |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Title: Approximation algorithm for k-anonymity
Title: Min cost bridgeless subgraph of min degree 2 (bridgeless D2)
| Speaker: | Jack Dippel |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: In the bridgeless D2 problem we have a graph with nonnegative edge costs and the goal is to complete a min cost subgraph of degree at least 2 at every node that has no bridges (i.e. no cut edges.).
We discuss NP-hardness, LP relaxations and approximation algorithms.
Title: On Cyclically 5-Connected Graphs
| Speaker: | Da Qi Chen |
| Affiliation: | University of Waterloo |
| Room: | M3 3103 |
Abstract: Tutte's Four-Flow Conjecture states that every bridgeless,
Petersen-minor-free graph admits a nowhere-zero 4-flow. This hard conjecture has been open for over half a century with no significant progress in the first forty years.
Title: Folding Operation on 3-by-2n Standard Young Tableaux
| Speaker: | Shelley Wu |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
Title: Drawings of Complete Graphs
| Speaker: | Matthew Sunohara |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
Title: Almost all matroids are non-representable
Title: Separation Dimension of Graphs and Hyper Graphs
| Speaker: | L. Sunil Chandran |
| Affiliation: | Indian Institute of Science, Bangalore |
| Room: | MC 6486 |
Abstract:
Title: Controllable Graphs Determined by their Generalized Spectrums
| Speaker: | Chen Xie |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
Title: Metric s-t path TSP and the randomized Christofides algorithm
| Speaker: | Shatian Wang |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
