An optical solution for the traveling salesman problem: erratum
Optics Express, Vol. 15, Issue 20, pp. 12627-12627 (2007)
http://dx.doi.org/10.1364/OE.15.012627
Enhanced HTML
Acrobat PDF (16 KB)
Abstract
The initialization time for setting up the experiment grows exponential with the number of cities. Therefore the overall time required to solve the problem is not quadratic but exponential.
© 2007 Optical Society of America
OCIS Codes
(120.3180) Instrumentation, measurement, and metrology : Interferometry
(200.0200) Optics in computing : Optics in computing
(200.4740) Optics in computing : Optical processing
(260.3160) Physical optics : Interference
ToC Category:
Optics in computing
History
Original Manuscript: September 5, 2007
Manuscript Accepted: September 13, 2007
Published: September 17, 2007
Citation
Tobias Haist and Wolfgang Osten, "An optical solution for the traveling salesman problem: erratum," Opt. Express 15, 12627-12627 (2007)
http://www.opticsinfobase.org/oe/abstract.cfm?URI=oe-15-20-12627
Sort: Year | Journal | Reset
References
- T. Haist and W. Osten, "An Optical Solution For The Traveling Salesman Problem," Opt. Express 15, 10473-10482 (2007) [CrossRef] [PubMed]
- M. Oltean, "A light-based device for solving the Hamiltonian path problem," in Lecture Notes in Computer Science 4135, 217-227, Springer (2006). [CrossRef]
- M. Oltean, "Solving the Hamiltonian path problem with a light-based computer," Natural Computing, to appear in Vol. 6, Issue 4, 2007.
- S. Dolev and H. Fitoussi, "The traveling beams optical solutions for bounded NP-Complete problems," in Lecture Notes in Computer Science 4475, 120-134 (2007). [CrossRef]
Cited By |
OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.





OSA is a member of 