ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network.
Irit DinurPasin ManurangsiPublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- constraint satisfaction problems
- network model
- np hard
- network traffic
- search algorithm
- wireless sensor networks
- np complete
- communication networks
- network structure
- network resources
- data sets
- constraint propagation
- temporal constraints
- computer networks
- complex networks
- wireless networks
- peer to peer
- worst case
- special case
- computational complexity