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="Hurkens, C.A.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Process discovery using integer linear programming
J.M.E.M. van der Werf
,
B.F. van Dongen
,
C.A.J. Hurkens
,
A. Serebrenik
Lecture Notes in Computer Science
5062
, 2008, pp. 368-387
Virtual private network design: A proof of the tree routing conjecture on ring networks
C.A.J. Hurkens
,
J.C.M. Keijsper
,
L. Stougie
SIAM Journal on Discrete Mathematics
21
(2), 2007, pp. 482-503
Virtual private network design: A proof of the tree routing conjecture on ring networks
C.A.J. Hurkens
,
J.C.M. Keijsper
,
L. Stougie
Lecture Notes in Computer Science
3509
, 2005, pp. 407-421
Nasty TSP instances for farthest insertion
C.A.J. Hurkens
Proceedings of the 2nd International Conference on Integer Programming and Combinatorial Optimization, IPCO'92 (Pittsburgh, PA, May 25-27, 1992)
, 1992, pp. 346-352
On the diameter of the edge cover polytope
C.A.J. Hurkens
Journal of Combinatorial Theory Series B
51
, 1991, pp. 271-276
On the size of systems of sets every
t
of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems
C.A.J. Hurkens
,
A. Schrijver
SIAM Journal on Discrete Mathematics
2
, 1989, pp. 68-72