Space filling curve heuristic and the traveling salesman problem

dc.contributor	Graduate Program in Mathematics.
dc.contributor.advisor	Altok, Serdar.
dc.contributor.author	Charyyev, Polat.
dc.date.accessioned	2023-03-16T11:21:38Z
dc.date.available	2023-03-16T11:21:38Z
dc.date.issued	2012.
dc.identifier.other	MATH 2012 C43
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/15263
dc.description.abstract	Let LSFC n denote the length of the path connecting n random points uniformly distributed over the unit square obtained by the space lling curve heuristic. For a Hilbert type of space lling curve such as; Peano, Moore, Sierpinski and Polya, we prove that for some number K, we have, for all ... ; where K depends only on the space ling curve. This thesis is motivated by the work of Gao and Steele [1], where they found an almost Gaussian tail bound for a broad class of space lling curves. By adapting the method of Rhee and Talagrand [2], we have obtained an exact Gaussian tail bound for the length of the path obtained by the space lling curve..
dc.format.extent	30 cm.
dc.publisher	Thesis (M.S.)-Bogazici University. Institute for Graduate Studies in Science and Engineering, 2012.
dc.relation	Includes appendices.
dc.relation	Includes appendices.
dc.subject.lcsh	Gaussian processes.
dc.subject.lcsh	Spectral theory (Mathematics)
dc.title	Space filling curve heuristic and the traveling salesman problem
dc.format.pages	ix, 63 leaves ;