ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1607.07906
  4. Cited By
Approximation and Parameterized Complexity of Minimax Approval Voting

Approximation and Parameterized Complexity of Minimax Approval Voting

26 July 2016
Marek Cygan
Lukasz Kowalik
Arkadiusz Socala
Krzysztof Sornat
ArXiv (abs)PDFHTML

Papers citing "Approximation and Parameterized Complexity of Minimax Approval Voting"

1 / 1 papers shown
Title
Parameterized Complexity of Multi-winner Determination: More Effort
  Towards Fixed-Parameter Tractability
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
Yongjie Yang
Jian-xin Wang
65
9
0
09 Jul 2021
1