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
OSA Recommended Articles
An Optical Solution For The Traveling Salesman Problem

Tobias Haist and Wolfgang Osten
Opt. Express 15(16) 10473-10482 (2007)

Optical solution for bounded NP-complete problems

Natan T. Shaked, Stephane Messika, Shlomi Dolev, and Joseph Rosen
Appl. Opt. 46(5) 711-724 (2007)

Balancing interferometers with slow-light elements

Alireza Marandi, Brian T. Lantz, and Robert L. Byer
Opt. Lett. 36(6) 933-935 (2011)

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 (2)

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]

T. Haist and W. Osten, “An optical solution for the traveling salesman problem,” Opt. Express 15, 10473–10482 (2007)
[Crossref] [PubMed]

2006 (1)

M. Oltean, “A light-based device for solving the Hamiltonian path problem,” in Lecture Notes in Computer Science 4135, 217–227, Springer (2006).
[Crossref]

Dolev, S.

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]

Fitoussi, H.

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]

Haist, T.

Oltean, M.

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.

Osten, W.

in Lecture Notes in Computer Science (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]

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]

Opt. Express (1)

Other (1)

M. Oltean, “Solving the Hamiltonian path problem with a light-based computer,” Natural Computing, to appear in Vol. 6, Issue 4, 2007.

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