A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation

Mayerhofer, Jonas; Kirchweger, Markus; Huber, Marc; Raidl, Günther R.

doi:10.1007/978-3-031-04148-8_9

by Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl

Reference:

A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length CalculationJonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. RaidlEvolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings (Leslie Pérez Cáceres, Sébastien Vérel, eds.), volume 13222 of Lecture Notes in Computer Science, pages 127–142, 2022, Springer Verlag.

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{MayerhoferKirchwegerHuberRaidl22,
  author    = {Jonas Mayerhofer and
               Markus Kirchweger and
               Marc Huber and
               G{\"{u}}nther R. Raidl},
  editor    = {Leslie P{\'{e}}rez C{\'{a}}ceres and
               S{\'{e}}bastien V{\'{e}}rel},
  title     = {A Beam Search for the Shortest Common Supersequence Problem Guided
               by an Approximate Expected Length Calculation},
  booktitle = {Evolutionary Computation in Combinatorial Optimization - 22nd European
               Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain,
               April 20-22, 2022, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {13222},
  pages     = {127--142},
  publisher = {Springer},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-031-04148-8\_9},
  doi       = {10.1007/978-3-031-04148-8\_9},
  timestamp = {Thu, 07 Apr 2022 18:19:54 +0200},
  biburl    = {https://dblp.org/rec/conf/evoW/MayerhoferKHR22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}