BibTeX record conf/approx/SachdevaS11

• > Home > conf/approx/SachdevaS11

@inproceedings{DBLP:conf/approx/SachdevaS11,
  author       = {Sushant Sachdeva and
                  Rishi Saket},
  editor       = {Leslie Ann Goldberg and
                  Klaus Jansen and
                  R. Ravi and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite
                  Hypergraphs},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
                  International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
                  17-19, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6845},
  pages        = {327--338},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22935-0\_28},
  doi          = {10.1007/978-3-642-22935-0\_28},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/SachdevaS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}