118 search results - page 7 / 24 » Complexity Cores and Hard Problem Instances |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
LATIN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
ACRI
2010
Springer
13 years 6 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...