9842 search results - page 49 / 1969 » The Complexity of the Matching-Cut Problem |
IJFCS
2006
13 years 7 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
PAMI
2000
13 years 7 months ago
2000
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
It is widely suspected that Erdos-R
ANOR
2007
13 years 7 months ago
2007
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
CODCRY
2011
Springer
12 years 11 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...