9842 search results - page 46 / 1969 » The Complexity of the Matching-Cut Problem |
UAI
2000
13 years 9 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
MST
2008
13 years 7 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
CCE
2010
13 years 5 months ago
2010
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...