BibTeX record journals/jda/KarpinskiSV15

download as .bib file

@article{DBLP:journals/jda/KarpinskiSV15,
  author       = {Marek Karpinski and
                  Richard Schmied and
                  Claus Viehmann},
  title        = {Nearly tight approximation bounds for vertex cover on dense k-uniform
                  k-partite hypergraphs},
  journal      = {J. Discrete Algorithms},
  volume       = {33},
  pages        = {49--57},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.jda.2014.12.010},
  doi          = {10.1016/J.JDA.2014.12.010},
  timestamp    = {Tue, 16 Feb 2021 14:03:28 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/KarpinskiSV15.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.