BibTeX record journals/disopt/BonnetEPS18

download as .bib file

@article{DBLP:journals/disopt/BonnetEPS18,
  author       = {{\'{E}}douard Bonnet and
                  Bruno Escoffier and
                  Vangelis Th. Paschos and
                  Georgios Stamoulis},
  title        = {Purely combinatorial approximation algorithms for maximum k-vertex
                  cover in bipartite graphs},
  journal      = {Discret. Optim.},
  volume       = {27},
  pages        = {26--56},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.disopt.2017.09.001},
  doi          = {10.1016/J.DISOPT.2017.09.001},
  timestamp    = {Sat, 22 Feb 2020 13:52:49 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BonnetEPS18.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.