Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, April 26, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Vladimir Tonche

New invariants for incidence structures

Speaker: Vladimir Tonchev
Affiliation: Michigan Technological University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

New isomorphism invariants for incidence structures based on a connection between trace codes and Galois geometry are discussed. Using these invariants, a new Hamada type characterization of the classical finite geometry designs is proved.

Friday, May 3, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Vijay Vazirani

New (Practical) Complementary Pivot Algorithms for Market  Equilibria

Speaker: Vijay Vazirani
Affiliation: Georgia Tech
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Complementary pivot algorithms, in the style of the simplex algorithm, tend to work well in practice despite having an exponential worst case behavior -- a case in point being the classic Lemke-Howson algorithm (1964) for 2-player Nash e

Friday, May 10, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Alejandro Toriello

Dynamic Programming Approximations for Traveling Salesman Problems

Speaker: Alejandro Toriello
Affiliation: USC
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We propose a framework of lower bounds for the asymmetric traveling salesman problem (TSP) based on approximating the dynamic programming formulation with basis vector sets.

Friday, May 17, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Chi-Kwong Li

Factorization of permutations

Speaker: Andrew Childs
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We discuss some results and problems concerning factorization of permutations arising in various areas including algebra, combinatorics, computer science, numerical linear algebra, optimization, genomics, quantum computing, etc.

Friday, May 24, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jochen Konemann

Network Diffusion and Node-Weighted Steiner Trees

Speaker: Jochen koenemann
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

The first part of this talk focuses on a network diffusion model that was recently introduced by Goldberg & Liu (SODA'13).

Friday, June 7, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Craig Boutilier

Preference Elicitation for Social Choice: A Study in Voting and Stable Matching

Speaker: Craig Boutilier
Affiliation: University of Toronto
Room: Mathematics and Computer Building (MC) 5158

Abstract:

While the methods of social choice provide firm foundations for many decision problems involving groups of individuals, their practical realization requires some means of eliciting, assessing, or learning the underlyi

Friday, June 14, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Robert Bixby - Tutte colloquium

The Department of Combinatorics & Optimization Tutte colloquium presents:

Professor Robert E. Bixby - Rice University and Gurobi Optimization

Friday, June 21, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Arun Mani

Some observation on correlations in graphs

Speaker: Arun Mani
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

It is known that if e,f are two distinct non-loop edges of a connected graph G and T is a spanning tree of G selected uniformly at random, then the two events  e ∈ T and f ∈ T are negatively correlated.

Wednesday, July 10, 2013 3:00 pm - 4:00 pm EDT (GMT -04:00)

Seminar - Yinyu Ye

Complexity Analysis beyond Convex Optimization

Speaker: Yinyu Ye
Affiliation: Standford University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A powerful approach to solving difficult optimization problems is convex relaxation.

Friday, July 12, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Gus Gutoski

Parallel approximation of min-max problems

Speaker: Gus Gutoski
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We present an efficient parallel approximation scheme for a new class of min-max problems.