BibTeX record journals/jco/DEmidioFFLP19

download as .bib file

@article{DBLP:journals/jco/DEmidioFFLP19,
  author       = {Mattia D'Emidio and
                  Luca Forlizzi and
                  Daniele Frigioni and
                  Stefano Leucci and
                  Guido Proietti},
  title        = {Hardness, approximability, and fixed-parameter tractability of the
                  clustered shortest-path tree problem},
  journal      = {J. Comb. Optim.},
  volume       = {38},
  number       = {1},
  pages        = {165--184},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10878-018-00374-x},
  doi          = {10.1007/S10878-018-00374-X},
  timestamp    = {Thu, 23 Jun 2022 20:03:50 +0200},
  biburl       = {https://dblp.org/rec/journals/jco/DEmidioFFLP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.