Space filling curve heuristic and the traveling salesman problem
Is this your thesis?
This record came from a bulk archive import. If it’s yours, link it to your profile.
Abstract (EN)
We have obtained an exact Gaussian tail bound for the length of the path connecting n random points uniformly distributed over the unit square obtained by the spacefilling curve heuristic.
Author
Polat Charyyev
How to Cite
Polat Charyyev (Master Thesis). Space filling curve heuristic and the traveling salesman problem, 2012, Boğaziçi University.
Keywords
License
Tüm Hakları Saklıdır
This work is shared under the specified license terms.
More theses from Boğaziçi University
- Investigating the factors affecting the acceptance of generative artificial intelligence in business intelligence applications(2025)
- Nükleer güç, emek ve çevre: Akkuyu NGS(2023)
- Behind the gallows: Capital punishment, law, and legislative performance in Turkey (1926-1990)(2025)
- Exploring the values for nature, nature connectedness, pro-environmental behaviour, and well-being: A case study on urban park visitors in Istanbul(2025)
- An assessment on the role of regional development agencies in environmental governance in Türkiye: A case study on Thrace Region(2025)
- Political ecology of milk production in Türkiye: Changing practices, rural livelihoods, and dairy animals(2025)