Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Untitled

Official source

https://mediaspace.epfl.ch/media/0_ha9g4495

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (32)

Duality (optimization)

In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives, the primal problem or the dual problem. If the primal is a minimization problem then the dual is a maximization problem (and vice versa). Any feasible solution to the primal (minimization) problem is at least as large as any feasible solution to the dual (maximization) problem.

Minimum spanning tree

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible. More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.

Steiner tree problem

In combinatorial mathematics, the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial optimization. While Steiner tree problems may be formulated in a number of settings, they all require an optimal interconnect for a given set of objects and a predefined objective function. One well-known variant, which is often used synonymously with the term Steiner tree problem, is the Steiner tree problem in graphs.

Philadelphia chromosome

The Philadelphia chromosome or Philadelphia translocation (Ph) is a specific genetic abnormality in chromosome 22 of leukemia cancer cells (particularly chronic myeloid leukemia (CML) cells). This chromosome is defective and unusually short because of reciprocal translocation, t(9;22)(q34;q11), of genetic material between chromosome 9 and chromosome 22, and contains a fusion gene called BCR-ABL1.

ABL (gene)

Tyrosine-protein kinase ABL1 also known as ABL1 is a protein that, in humans, is encoded by the ABL1 gene (previous symbol ABL) located on chromosome 9. c-Abl is sometimes used to refer to the version of the gene found within the mammalian genome, while v-Abl refers to the viral gene, which was initially isolated from the Abelson murine leukemia virus. The ABL1 proto-oncogene encodes a cytoplasmic and nuclear protein tyrosine kinase that has been implicated in processes of cell differentiation, cell division, cell adhesion, and stress response such as DNA repair.

Related lectures (28)

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Linear Programming Duality

Covers linear programming duality and complementary slackness condition.

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Differential Forms Integration

Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.

Set Cover: Integrality Gap