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

Full Article  |  PDF Article

References

  • View by:
  • |
  • |
  • |

  1. T. Haist and W. Osten, "An Optical Solution For The Traveling Salesman Problem," Opt. Express 15, 10473-10482 (2007)
    [CrossRef] [PubMed]
  2. M. Oltean, "A light-based device for solving the Hamiltonian path problem," in Lecture Notes in Computer Science 4135, 217-227, Springer (2006).
    [CrossRef]
  3. M. Oltean, "Solving the Hamiltonian path problem with a light-based computer," Natural Computing, to appear in Vol. 6, Issue 4, 2007.
  4. 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]

2007 (1)

Opt. Express (1)

Other (3)

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 participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.


Metrics