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

Concept

Karmarkar's algorithm

Related publications (24)

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Krister Swenson, Vaibhav Rajan

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

Springer2009

Some coloring and walking problems in graphs

Benjamin Leroy-Beaulieu

Graph theory is an important topic in discrete mathematics. It is particularly interesting because it has a wide range of applications. Among the main problems in graph theory, we shall mention the following ones: graph coloring and the Hamiltonian circuit ...

EPFL2008

Recognition of generalized network matrices

Antoine Musitelli

In this thesis, we deal with binet matrices, an extension of network matrices. The main result of this thesis is the following. A rational matrix A of size n×m can be tested for being binet in time O(n6m). If A is binet, our algorithm outputs a nonsingular ...

EPFL2007

Parametric Analysis of Controllers for Constrained Linear Systems

Colin Neil Jones

We analyze properties of closed-loop systems based on explicit model predictive control (MPC) when parameters of the controllers are changing. Formulation of the problem in the framework of MPC with a cost based on piecewise linear norms leads to the gener ...

IEEE2006