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
[1]
Hilfe
Suche: Author="Krumke, S.O."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Euler is standing in line dial-a-ride problems with precedence-constraints
D. Hauptmeier
,
S.O. Krumke
,
J. Rambau
,
H.-C. Wirth
Discrete Applied Mathematics
113
(1), 2001, pp. 87-107
Upgrading bottleneck constrained forests
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
S.S. Ravi
,
H.-C. Wirth
Discrete Applied Mathematics
108
(1-2), 2001, pp. 129-142
Euler is standing in line - Dial-a-ride problems with precedence-constraints
D. Hauptmeier
,
S.O. Krumke
,
J. Rambau
,
H.-C. Wirth
Lecture Notes in Computer Science
1665
, 1999, pp. 42-54
Improving minimum cost spanning trees by upgrading nodes
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
R. Ravi
,
S.S. Ravi
,
S. Sundaram
,
H.-C. Wirth
Journal of Algorithms
33
(1), 1999, pp. 92-111
Upgrading bottleneck constrained forests
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
S.S. Ravi
,
H.-C. Wirth
Lecture Notes in Computer Science
1517
, 1998, pp. 215-226
On budget-constrained flow improvement
S. Schwarz
,
S.O. Krumke
Information Processing Letters
66
(6), 1998, pp. 291-297
Compact location problems
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
V. Radhakrishnan
,
S.S. Ravi
,
D.J. Rosenkrantz
Theoretical Computer Science
181
(2), 1997, pp. 379-404
Improving spanning trees by upgrading nodes
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
R. Ravi
,
S.S. Ravi
,
R. Sundaram
,
H.C. Wirth
Lecture Notes in Computer Science
1256
, 1997, pp. 281-291
Modifying networks to obtain low cost trees
S.O. Krumke
,
H. Noltemeier
,
M.V. Marathe
,
S.S. Ravi
,
K.U. Drangmeister
Lecture Notes in Computer Science
1197
, 1997, pp. 293-307
Compact location problems with budget and communication constraints
S.O. Krumke
,
H. Noltemeier
,
S.S. Ravi
,
M.V. Marathe
Lecture Notes in Computer Science
959
, 1995, pp. 510-519
Complexity and approximability of certain bicriteria location problems
S.O. Krumke
,
H. Noltemeier
,
S.S. Ravi
,
M.V. Marathe
Lecture Notes in Computer Science
1017
, 1995, pp. 73-87
On a generalization of the
p
-Center Problem
S.O. Krumke
Information Processing Letters
56
, 1995, pp. 67-71