BibTeX record conf/coco/SachdevaS13

download as .bib file

@inproceedings{DBLP:conf/coco/SachdevaS13,
  author       = {Sushant Sachdeva and
                  Rishi Saket},
  title        = {Optimal Inapproximability for Scheduling Problems via Structural Hardness
                  for Hypergraph Vertex Cover},
  booktitle    = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
                  2013, K.lo Alto, California, USA, 5-7 June, 2013},
  pages        = {219--229},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/CCC.2013.30},
  doi          = {10.1109/CCC.2013.30},
  timestamp    = {Fri, 24 Mar 2023 00:04:21 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/SachdevaS13.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.