ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
The task of multi-camera surveillance is to reconstruct the paths taken by all moving objects that are temporarily visible from multiple non-overlapping cameras. We present a Baye...
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...