129 search results - page 10 / 26 » The Parameterized Complexity of the Minimum Shared Edges Pro... |
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
SOFSEM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
DISOPT
2010
14 years 9 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
103
click to vote
AAAI
2012
12 years 12 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...