A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
Shmuel FriedlandDaniel LevyPublished in: CoRR (2006)
Keyphrases
- polynomial time approximation
- computational complexity
- bipartite graph
- maximum cardinality
- np hard
- dynamic programming
- theoretical analysis
- bin packing
- simulated annealing
- optimal solution
- learning algorithm
- error bounds
- search space
- randomized algorithm
- linear programming
- integer programming
- minimum spanning tree
- objective function