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="Rubinstein, J.H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polynomial algorithm for a constrained Traveling Salesman problem
J.H. Rubinstein
,
D.A. Thomas
,
N.C. Wormald
Networks
38
(2), 2001, pp. 68-75
Full minimal Steiner trees on lattice sets
M. Brazil
,
J.H. Rubinstein
,
D.A. Thomas
,
J.F. Weng
,
N.C. Wormald
Journal of Combinatorial Theory Series A
78
(1), 1997, pp. 51-91
Minimal Steiner trees for rectangular arrays of lattice points
M. Brazil
,
J.H. Rubinstein
,
D.A. Thomas
,
J.F. Weng
,
N.C. Wormald
Journal of Combinatorial Theory Series A
79
(2), 1997, pp. 181-208
Steiner trees for terminals constrained to curves
J.H. Rubinstein
,
D.A. Thomas
,
N.C. Wormald
SIAM Journal on Discrete Mathematics
10
(1), 1997, pp. 1-17
Minimal Steiner trees for
2^k\times2^k
square lattices
M. Brazil
,
T. Cole
,
J.H. Rubinstein
,
D.A. Thomas
,
J.F. Weng
,
N.C. Wormald
Journal of Combinatorial Theory Series A
73
(1), 1996, pp. 91-110
Degree-five Steiner points cannot reduce network cost for planar sets
J.H. Rubinstein
,
D.A. Thomas
,
J.F. Weng
Networks
22
(6), 1992, pp. 531-537
Graham's problem on shortest networks for points on a circle
J.H. Rubinstein
,
D.A. Thomas
Algorithmica
7
, 1992, pp. 193-218
The Steiner ratio conjecture for six points
J.H. Rubinstein
,
D.A. Thomas
Journal of Combinatorial Theory Series A
58
, 1991, pp. 54-77