An Efficient Greedy Algorithm for finding the Nearest Simultaneous Diagonalizable Family.

Riku Akema Masao Yamagishi Isao Yamada

Published in: SSP (2018)

Keyphrases

greedy algorithm
greedy algorithms
worst case
objective function
dynamic programming
knapsack problem
greedy strategy
special case
set cover
influence maximization
greedy heuristic
influence spread
social networks
data points
approximation guarantees
submodular functions