Finding (Near-)Optimal Steiner Trees in Large Graphs

by

Esbensen, H.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the Sixth International Conference on Genetic Algorithms (Conference proceedings), 1995, p. 485-491
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{Esbensen:1995:FNO,
  title =        "Finding (Near-)Optimal {S}teiner Trees in Large
                 Graphs",
  author =       "Henrik Esbensen",
  booktitle =    "Proceedings of the Sixth International Conference on
                 Genetic Algorithms",
  editor =       "Larry Eshelman",
  year =         "1995",
  address =      "San Francisco, CA",
  publisher =    "Morgan Kaufmann",
  pages =        "485--491",
}