BibTeX record journals/combinatorics/GoldsteinKZ05

download as .bib file

@article{DBLP:journals/combinatorics/GoldsteinKZ05,
  author       = {Avraham Goldstein and
                  Petr Kolman and
                  Jie Zheng},
  title        = {Minimum Common String Partition Problem: Hardness and Approximations},
  journal      = {Electron. J. Comb.},
  volume       = {12},
  year         = {2005},
  url          = {https://doi.org/10.37236/1947},
  doi          = {10.37236/1947},
  timestamp    = {Fri, 10 Jun 2022 10:35:07 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/GoldsteinKZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.