Approximation and Parameterized Complexity of Minimax Approval Voting

Marek Cygan, Lukasz Kowalik, Arkadiusz Socala, Krzysztof Sornat. Approximation and Parameterized Complexity of Minimax Approval Voting. In Satinder P. Singh, Shaul Markovitch, editors, Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA. pages 459-465, AAAI Press, 2017. [doi]

@inproceedings{CyganKSS17,
  title = {Approximation and Parameterized Complexity of Minimax Approval Voting},
  author = {Marek Cygan and Lukasz Kowalik and Arkadiusz Socala and Krzysztof Sornat},
  year = {2017},
  url = {http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14554},
  researchr = {https://researchr.org/publication/CyganKSS17},
  cites = {0},
  citedby = {0},
  pages = {459-465},
  booktitle = {Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA},
  editor = {Satinder P. Singh and Shaul Markovitch},
  publisher = {AAAI Press},
}