Results 1  10
of
36
Llull and Copeland voting computationally resist bribery and control
, 2009
"... Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Constructive control of elections refers to attempts by an agent to, via such actions as addition/deletion/partition of candidates or voters, ensure that a given candidate wins. Destructive con ..."
Abstract

Cited by 34 (15 self)
 Add to MetaCart
Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Constructive control of elections refers to attempts by an agent to, via such actions as addition/deletion/partition of candidates or voters, ensure that a given candidate wins. Destructive control refers to attempts by an agent to, via the same actions, preclude a given candidate’s victory. An election system in which an agent can sometimes affect the result and it can be determined in polynomial time on which inputs the agent can succeed is said to be vulnerable to the given type of control. An election system in which an agent can sometimes affect the result, yet in which it is NPhard to recognize the inputs on which the agent can succeed, is said to be resistant to the given type of control. Aside from election systems with an NPhard winner problem, the only systems previously known to be resistant to all the standard control types were highly artificial election systems created by hybridization. This paper studies a parameterized version of Copeland voting, denoted by Copeland α, where the parameter α is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates. In every previously studied constructive or destructive
Pattern Matching for ArcAnnotated Sequences
 In Proc. of 22nd FSTTCS, number 2556 in LNCS
, 2002
"... A study of pattern matching for arcannotated sequences is started. An O(nm) time algorithm is given to determine whether a length m sequence with nested arc annotations is an arcpreserving subsequence of a length n sequence with nested arc annotations, called APS(nested,nested). Arcannotated ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
A study of pattern matching for arcannotated sequences is started. An O(nm) time algorithm is given to determine whether a length m sequence with nested arc annotations is an arcpreserving subsequence of a length n sequence with nested arc annotations, called APS(nested,nested). Arcannotated sequences and, in particular, those with nested arc structure are motivated by applications in RNA structure comparison. Our algorithm can be used to accelerate a recent fixedparameter algorithm for LAPCS(nested,nested) and generalizes results for ordered tree inclusion problems. In particular, the presented dynamic programming methodology implies a quadratic time algorithm for an open problem posed by Vialette.
A Structural View on Parameterizing Problems: Distance from Triviality
 In First International Workshop on Parameterized and Exact Computation, IWPEC 2004, LNCS Proceedings
, 2004
"... Based on a series of known and new examples, we propose the generalized setting of "distance from triviality" measurement as a reasonable and prospective way of determining useful structural problem parameters in analyzing computationally hard problems. The underlying idea is to consid ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
Based on a series of known and new examples, we propose the generalized setting of "distance from triviality" measurement as a reasonable and prospective way of determining useful structural problem parameters in analyzing computationally hard problems. The underlying idea is to consider tractable special cases of generally hard problems and to introduce parameters that measure the distance from these special cases. In this paper we present several case studies of distance from triviality parameterizations (concerning Clique, Power Dominating Set, Set Cover, and Longest Common Subsequence) that exhibit the versatility of this approach to develop important new views for computational complexity analysis.
On notions of regularity for data languages
 In FCT
, 2007
"... Motivated by considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expres ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
Motivated by considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for data languages. Recently, such a model, data automata, was introduced. This paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties, and some extensions. 1
How Hard Is Bribery in Elections?
"... We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change their preferences a specified candidate can be made the election’s winner? We study this problem for election systems as v ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change their preferences a specified candidate can be made the election’s winner? We study this problem for election systems as varied as scoring protocols and Dodgson voting, and in a variety of settings regarding homogeneousvs.nonhomogeneous electorate bribability, boundedsizevs.arbitrarysized candidate sets, weightedvs.unweighted voters, and succinctvs.nonsuccinct input specification. We obtain both polynomialtime bribery algorithms and proofs of the intractability of bribery, and indeed our results show that the complexity of bribery is extremely sensitive to the setting. For example, we find settings in which bribery is NPcomplete but manipulation (by voters) is in P, and we find settings in which bribing weighted voters is NPcomplete but bribing voters with individual bribe thresholds is in P. For the broad class of elections (including plurality, Borda, kapproval, and veto) known as scoring protocols, we prove a dichotomy result for bribery of weighted voters: We find a simpletoevaluate condition that classifies every case as either NPcomplete or in P. 1.
On the Complexity of Fixed Parameter Clique and Dominating Set
, 2004
"... We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection.
Guarantees for the success frequency of an algorithm for finding Dodgsonelection winners
 In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science
, 2006
"... Dodgson’s election system elegantly satisfies the Condorcet criterion. However, determining the winner of a Dodgson election is known to be Θ p 2complete ([HHR97], see also [BTT89]), which implies that unless P = NP no polynomialtime solution to this problem exists, and unless the polynomial hiera ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
Dodgson’s election system elegantly satisfies the Condorcet criterion. However, determining the winner of a Dodgson election is known to be Θ p 2complete ([HHR97], see also [BTT89]), which implies that unless P = NP no polynomialtime solution to this problem exists, and unless the polynomial hierarchy collapses to NP the problem is not even in NP. Nonetheless, we prove that when the number of voters is much greater than the number of candidates (although the number of voters may still be polynomial in the number of candidates), a simple greedy algorithm very frequently finds the Dodgson winners in such a way that it “knows” that it has found them, and furthermore the algorithm never incorrectly declares a nonwinner to be a winner. 1
Exact algorithms and applications for Treelike Weighted Set Cover
 JOURNAL OF DISCRETE ALGORITHMS
, 2006
"... We introduce an NPcomplete special case of the Weighted Set Cover problem and show its fixedparameter tractability with respect to the maximum subset size, a parameter that appears to be small in relevant applications. More precisely, in this practically relevant variant we require that the given ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We introduce an NPcomplete special case of the Weighted Set Cover problem and show its fixedparameter tractability with respect to the maximum subset size, a parameter that appears to be small in relevant applications. More precisely, in this practically relevant variant we require that the given collection C of subsets of a some base set S should be “treelike.” That is, the subsets in C can be organized in a tree T such that every subset onetoone corresponds to a tree node and, for each element s of S, the nodes corresponding to the subsets containing s induce a subtree of T. This is equivalent to the problem of finding a minimum edge cover in an edgeweighted acyclic hypergraph. Our main result is an algorithm running in O(3 k ·mn) time where k denotes the maximum subset size, n: = S, and m: = C. The algorithm also implies a fixedparameter tractability result for the NPcomplete Multicut in Trees problem, complementing previous approximation results. Our results find applications in computational biology in phylogenomics and for saving memory in tree decomposition based graph algorithms.
On the parameterized intractability of motif search problems
 Combinatorica
, 2006
"... We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]hard when parameterized by the number k of input strings (and remains so, even over a binary alphabet). This problem is therefore unlikely to be solvable in time O(f(k) · n c) fo ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]hard when parameterized by the number k of input strings (and remains so, even over a binary alphabet). This problem is therefore unlikely to be solvable in time O(f(k) · n c) for any function f of k and constant c independent of k. The problem can therefore be expected to be intractable, in any practical sense, for k ≥ 3. Our result supports the intuition that Closest Substring is computationally much harder than the special case of Closest String, although both problems are NPcomplete. We also prove W[1]hardness for other parameterizations in the case of unbounded alphabet size. Our W[1]hardness result for Closest Substring generalizes to Consensus Patterns, a problem of similar significance in computational biology. 1
Parameterized Complexity of Geometric Problems
, 2007
"... This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixedparameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixedparameter in ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixedparameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixedparameter intractability results are surveyed as well. Finally, we give some directions for future research.