Skip to main content
Article thumbnail
Location of Repository

Fixed-parameter tractability and parameterized complexity, applied to problems from computational social choice

By Claudia Lindner and Jörg Rothe

Abstract

This supplement provides a brief introduction to the field of fixed-parameter tractability and parameterized complexity. Some basic notions are explained and some related results are presented, with a focus on problems arising in the field of computational social choice

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.9213
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.stanford.edu/~rrwil... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.