On the Difficulty of Approximately Maximizing Agreements

Cite

Text

Ben-David et al. "On the Difficulty of Approximately Maximizing Agreements." Annual Conference on Computational Learning Theory, 2000. doi:10.1016/S0022-0000(03)00038-2

Markdown

[Ben-David et al. "On the Difficulty of Approximately Maximizing Agreements." Annual Conference on Computational Learning Theory, 2000.](https://mlanthology.org/colt/2000/bendavid2000colt-difficulty/) doi:10.1016/S0022-0000(03)00038-2

BibTeX

@inproceedings{bendavid2000colt-difficulty,
  title     = {{On the Difficulty of Approximately Maximizing Agreements}},
  author    = {Ben-David, Shai and Eiron, Nadav and Long, Philip M.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2000},
  pages     = {266-274},
  doi       = {10.1016/S0022-0000(03)00038-2},
  url       = {https://mlanthology.org/colt/2000/bendavid2000colt-difficulty/}
}