Christoph Hunkenschröder

Cette personne n’est plus à l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (5)

On compact representations of Voronoi cells of lattices

Christoph Hunkenschröder, Matthias Schymura

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem

Christoph Hunkenschröder

We present a factors 4/3 approximation algorithm for the problem of finding a minimum 2-edge connected spanning subgraph of a given undirected multigraph. The algorithm is based upon a reduction to a restricted class of graphs. In these graphs, the approxi ...

2019

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

On compact representations of Voronoi cells of lattices

Christoph Hunkenschröder, Matthias Schymura

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Page 1 sur 1