Approximability of cycle covers and smoothed analysis of binary search trees

dc.affiliation.institute	Institut für Theoretische Informatik	de
dc.contributor.author	Manthey, Bodo
dc.contributor.referee	Reischuk, Rüdiger
dc.contributor.referee	Mehlhorn, Kurt
dc.date.accepted	2005
dc.date.accessioned	2023-07-21T10:51:49Z
dc.date.available	2023-07-21T10:51:49Z
dc.date.issued	2005
dc.identifier.dnbppn	978602366
dc.identifier.gbvppn	510962386
dc.identifier.uri	https://epub.uni-luebeck.de/handle/zhb_hl/60
dc.identifier.urn	urn:nbn:de:gbv:841-20061215193
dc.language	eng
dc.language.iso	en
dc.language.rfc3066	en-US
dc.publisher.department	Technisch-Naturwissenschaftlichen Fakultät	de
dc.publisher.place	Lübeck	de
dc.subject.ddc	510
dc.title	Approximability of cycle covers and smoothed analysis of binary search trees	en
dc.type	thesis.doctoral

Dateien

Gerade angezeigt 1 - 1 von 1