On the hardness of evaluating criticality of activities in a planar network with duration intervals.
Stefan ChanasPawel ZielinskiPublished in: Oper. Res. Lett. (2003)
Keyphrases
- computational complexity
- network traffic
- video sequences
- communication patterns
- network model
- learning theory
- computer networks
- network structure
- np complete
- peer to peer
- np hard
- complex networks
- human activities
- activity recognition
- daily life
- network management
- network design
- computer vision
- network parameters
- projector camera