Sören Laue

GEOMETRIC SET COVER AND HITTING SETS FOR POLYTOPES IN R 3

Suppose we are given a finite set of points

Approximating parameterized convex optimization problems

P

Generating massive complex networks with hyperbolic geometry faster in practice

in

Optimizing over the growing spectrahedron

R^3

Minimum-energy broadcast with few senders

and a collection of polytopes

A Faster Algorithm for Two-Variable Integer Programming

mathcal{T}

Deducing individual driving preferences for user-aware navigation

that are all translates of the same polytope

A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs

T

Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane.

. We consider two problems in this paper. The first is the set cover problem where we want to select a minimal number of polytopes from the collection

Reconstructing a Sparse Solution from a Compressed Support Vector Machine

mathcal{T}