Elke Eisenschmidt

activity

20062011

most citedComputation of Atomic Fibers of Z-Linear Maps

2 citations · 3 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2011

A Polynomial Time Approximation Algorithm for the Two-Commodity Splittable Flow Problem

Elke Eisenschmidt, Utz-Uwe Haus

We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity $i \in 1, 2$ can be split into a bounded number $k_{i}$ o…

math.CO2007★ 2 cited

Computation of Atomic Fibers of Z-Linear Maps

Elke Eisenschmidt, Raymond Hemmecke, Matthias Köppe

For given matrix $A \in Z^{d \times n}$ , the set $P_{b} = {z : A z = b, z \in Z_{+}^{n}}$ describes the preimage or fiber of $b \in Z^{d}$ under the $Z$ -linear map $f_{A} : Z_{+}^{n} \to Z^{d}$ , $x\mapsto…

math.OC2006★ 1 cited

Integer Minkowski Programs and the Design of Survivable Networks

Elke Eisenschmidt, Matthias Köppe, Alexandre Laugier

We introduce a new class of optimization problems called integer Minkowski programs. The formulation of such problems involves finitely many integer variables and nonlinear constra…