BibTeX record conf/approx/AustrinS19

• > Home > conf/approx/AustrinS19

@inproceedings{DBLP:conf/approx/AustrinS19,
  author       = {Per Austrin and
                  Aleksa Stankovic},
  editor       = {Dimitris Achlioptas and
                  L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title        = {Global Cardinality Constraints Make Approximating Some Max-2-CSPs
                  Harder},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
                  Institute of Technology, Cambridge, MA, {USA}},
  series       = {LIPIcs},
  volume       = {145},
  pages        = {24:1--24:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.24},
  doi          = {10.4230/LIPICS.APPROX-RANDOM.2019.24},
  timestamp    = {Wed, 21 Aug 2024 22:46:00 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/AustrinS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}