NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
type: Item
instance of: scholarly article
title: NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
zbMATH Open document ID: 1346.68101
author: Robert Bredereck
author: Nimrod Talmon
published in: Information Processing Letters
publication date: 2015-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91B12
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 6515014
zbMATH Keywords: computational complexity
zbMATH Keywords: computational social choice
zbMATH Keywords: graph problems
zbMATH Keywords: manipulating elections
zbMATH Keywords: approval voting
Wikidata QID: Q62039068
MaRDI profile type: Publication
full work available at URL: j.ipl.2015.09.008
OpenAlex ID: W2152019671
cites work: How hard is it to control an election?
cites work: General factors of graphs
cites work: Swap Bribery
cites work: Control and Bribery in Voting
cites work: How Hard Is Bribery in Elections?
cites work: Q4198056
cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
cites work: Reducibility among Combinatorial Problems
cites work: Q3048571
cites work: Graph factors and factorization: 1985--2003: a survey
DOI: 10.1016/J.IPL.2015.09.008
description: scientific article; zbMATH DE number 6515014