Sciweavers

IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
13 years 6 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
TCS
2010
13 years 9 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
COR
2007
79views more  COR 2007»
13 years 11 months ago
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
CPAIOR
2005
Springer
14 years 4 months ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...