A Fast Approximation for Maximum Weight Matroid Intersection.

Chandra Chekuri Kent Quanrud

Published in: SODA (2016)

Keyphrases

maximum weight
independent set
bipartite matching
partial order
bipartite graph
minimum weight
weighted graph
greedy algorithm
bipartite graph matching
submodular functions
directed graph
combinatorial optimization
random walk
multi dimensional
response time
np hard
genetic algorithm