The Packed Interval Covering Problem is NP-complete.
Abdallah SaffidineSébastien Lê CongSophie PinchinatFrançois SchwarzentruberPublished in: CoRR (2019)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- constraint satisfaction problems
- computational complexity
- pspace complete
- polynomial time complexity
- interval data
- data complexity
- conjunctive queries
- data sets
- artificial intelligence
- databases
- real time
- special case
- search algorithm
- sat problem
- real world
- bounded treewidth
- minimum volume
- type fuzzy logic systems