Tracking in a spaghetti bowl: monitoring transactions using footprints
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A fast bipartite network flow algorithm for selective assembly
Operations Research Letters
Cooperative assignment games with the inverse Monge property
Discrete Applied Mathematics
| Hi-index | 0.00 |
The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red union Blue, Red * Blue), where mod Red mod = n, mod Blue mod = m, n