32 search results - page 1 / 7 » Crozzle: an NP-complete problem |
SAC
1997
ACM
13 years 9 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
ALGOSENSORS
2010
Springer
13 years 3 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
INFOCOM
2000
IEEE
13 years 9 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...