9842 search results - page 153 / 1969 » The Complexity of the Matching-Cut Problem |
CIAC
2006
Springer
14 years 2 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
COR
2008
13 years 10 months ago
2008
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
EOR
2007
13 years 10 months ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...