Fast approximation algorithms for task-based runtime systems.

Olivier Beaumont Lionel Eyraud-Dubois Suraj Kumar

Published in: Concurr. Comput. Pract. Exp. (2018)

Keyphrases

approximation algorithms
np hard
special case
worst case
facility location problem
approximation ratio
undirected graph
network design problem
vertex cover
objective function
search algorithm
minimum cost
np hardness
open shop
disjoint paths