A Semi-Greedy Heuristic for the Mapping of Large Task Graphs.
Karl-Eduard BergerFrançois GaleaBertrand Le CunRenaud SirdeyPublished in: IPDPS Workshops (2016)
Keyphrases
- greedy heuristic
- greedy algorithm
- np hard
- knapsack problem
- worst case analysis
- minimum weight
- optimal solution
- set cover
- structured objects
- graph theoretic
- graph representation
- lower bound
- graph theory
- graph mining
- graph databases
- weighted graph
- graph clustering
- ontology mapping
- database
- approximation algorithms
- structured data
- upper bound
- neural network