Sign in
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method.
David Gamarnik
Tomasz Nowicki
Grzegorz Swirszcz
Published in:
Random Struct. Algorithms (2006)
Keyphrases
</>
maximum weight
probabilistic model
convergence rate
bipartite matching
data structure
computational complexity
high dimensional
np hard
binary images
combinatorial optimization
greedy algorithm
partial order
knapsack problem
random graphs