Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions.

Sheela Orgler Mark Blacher

Published in: CoRR (2024)

Keyphrases

greedy algorithm
cost function
greedy algorithms
objective function
set cover
greedy strategy
worst case
knapsack problem
greedy heuristic
influence maximization
dynamic programming
social networks
approximation guarantees
higher order
high order
submodular functions