Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Laue, S{\"o}ren"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimizing over the growing spectrahedron
Joachim Giesen
,
Martin Jaggi
,
Sören Laue
Lecture Notes in Computer Science
7501
, 2012, pp. 503-514
Approximating parameterized convex optimization problems
Joachim Giesen
,
Martin Jaggi
,
Sören Laue
Lecture Notes in Computer Science
6346
, 2010, pp. 524-535
Approximating
k
-hop minimum spanning trees in Euclidean metrics
Sören Laue
,
Domagoj Matijević
Information Processing Letters
107
(3-4), 2008, pp. 96-101
Geometric set cover and hitting sets for polytopes in
R^3
Sören Laue
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 479-490
Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets
Stefan Funke
,
Sören Laue
Lecture Notes in Computer Science
4393
, 2007, pp. 272-283
A faster algorithm for two-variable integer programming
Friedrich Eisenbrand
,
Sören Laue
Lecture Notes in Computer Science
2906
, 2003, pp. 290-299