TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 20.03.2017

isti-logo

Inhalt

zur Navigation

Es gibt keine deutsche Übersetzung dieser Webseite.

From Lenstra to n-fold IP (there and back again)

Dusan Knop (Charles University Prague)

 

We will show some examples of n-fold IPs (closest string, swap bribery). Theory needed to understand how to find optimal solution for n-fold IPs when given a solution will be provided. Finally we will discuss the consequences of this algorithms and a work in progress about swap bribery with unit costs. [based on joint work with Martin Koutecky and Mathias Mnich]

 

Date
Speaker
Location
Language
20.03.2017
14:00
Dusan Knop
TEL 512
English

Back to the research colloquium site.

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe