A smaller cover of the moser’s worm problem
© 2018, Chiang Mai University. All rights reserved. The Moser’s worm problem asks for a smallest set on the plane that contains a congruent copy of every unit arc. Such smallest covering set has not been found yet. The smallest known cover constructed by Norwood and Poole in 2003 [6] has area 0.2604...
Saved in:
Main Authors: | Nattapol Ploymaklam, Wacharin Wichiramala |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85056428911&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62569 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
A Smaller Cover of the Moser’s Worm Problem
by: Nattapol Ploymaklam, et al.
Published: (2019) -
An improved approximation algorithm for the s-t path movement problem
by: Wattana Jindaluang, et al.
Published: (2018) -
A barium-calcium silicate glass for use as seals in planar SOFCs
by: Prachaya Namwong, et al.
Published: (2018) -
Wetzel’s sector covers unit arcs
by: Chatchawan Panraksa, et al.
Published: (2020) -
Water quality and heavy metal monitoring in water, sediments, and tissues of Corbicula sp. from Bung Boraphet reservoir, Thailand
by: Tinnapan Netpae, et al.
Published: (2018)