836 search results - page 27 / 168 » On the Complexity of Train Assignment Problems |
123
Voted
ECCC
2007
15 years 3 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
169
Voted
SIAMCOMP
2010
14 years 10 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
177
Voted
IWPEC
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
89
Voted
JSAT
2007
15 years 3 months ago
2007
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
132
Voted
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...