Sciweavers

1054 search results - page 16 / 211
» Capacitated Domination Problem
Sort
View
DM
2006
104views more  DM 2006»
13 years 7 months ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
ECAI
1994
Springer
13 years 11 months ago
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
W. P. M. Nuijten, Emile H. L. Aarts
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 7 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
FSTTCS
2009
Springer
14 years 2 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
ICML
2006
IEEE
14 years 8 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham