Conférence - Vera Traub : Network Design Problems: Approximation Algorithms and Linear Programming Relaxations (1) episode artwork

EPISODE · Jun 8, 2026 · 1H 5M

Conférence - Vera Traub : Network Design Problems: Approximation Algorithms and Linear Programming Relaxations (1)

from Collège de France - Sélection · host Panagiotis Souganidis

Pierre-Louis LionsÉquations aux dérivées partielles et applicationsCollège de FranceAnnée 2025-2026Network Design Problems: Approximation Algorithms and Linear Programming RelaxationsConférence - Vera Traub : Network Design Problems: Approximation Algorithms and Linear Programming Relaxations (1)Vera TraubProfesseure, ETH ZurichCréé en 2023, le cours Peccot International récompense spécifiquement de jeunes mathématiciennes européennes, invitées à donner une série de conférences au Collège de France. Vera Traub est lauréate du cours Peccot International pour l'année 2025-2026, sur proposition du professeur Pierre-Louis Lions, chaire Équations aux dérivées partielles et applications.

Episode metadata supplied by the publisher feed · Published Jun 8, 2026

Embed this episode

NOW PLAYING

Conférence - Vera Traub : Network Design Problems: Approximation Algorithms and Linear Programming Relaxations (1)

0:00 1:05:28

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Collège de France - Sélection?

This episode is 1 hour and 5 minutes long.

When was this Collège de France - Sélection episode published?

This episode was published on June 8, 2026.

Can I download this Collège de France - Sélection episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!