scientific article; zbMATH DE number 3338967
From MaRDI portal
Publication:5615775
zbMATH Open0213.44801MaRDI QIDQ5615775FDOQ5615775
Authors: Yefim Dinitz, M. A. Kronrod 
Publication date: 1969
Title of this publication is not available (Why is that?)
Cited In (13)
- Optimum matchings in weighted bipartite graphs
- Minimum jointly structural input and output selection
- Critical objective function values in linear sum assignment problems
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
- Maximum weight bipartite matching in matrix multiplication time
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- Linear-time approximation for maximum weight matching
- Parallel-machine scheduling with maintenance: praising the assignment problem
- A statistical correlation technique and a neural network for the motion correspondence problem
- An equivalency problem in discrete programming over ordered semigroups
- A genuinely polynomial primal simplex algorithm for the assignment problem
- An algorithm for algebraic assignment problems
- The auction algorithm: A distributed relaxation method for the assignment problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5615775)
