Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing.
Sören HenningKlaus JansenMalin RauLars SchmarjePublished in: CoRR (2017)
Keyphrases
- strip packing
- parallel implementation
- computational complexity
- parallel processing
- worst case
- general purpose
- shared memory
- space complexity
- scheduling algorithm
- database
- computational cost
- search engine
- real world
- databases
- np hard
- query processing
- information retrieval
- data mining
- complexity analysis
- distributed memory
- parallel programming
- distributed memory machines