Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
From MaRDI portal
Recommendations
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- Maximum matching of given weight in complete and complete bipartite graphs
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- A decomposition theorem for maximum weight bipartite matchings
- A scaling algorithm for maximum weight matching in bipartite graphs
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- Algorithms for two bottleneck optimization problems
- An augmenting path method for solving linear bottleneck assignment problems
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- Solving linear bottleneck assignment problems via strong spanning trees
Cited in
(26)- On the fast delivery problem with one or two packages
- Selected topics on assignment problems
- Bottleneck partial-matching Voronoi diagrams and applications
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- scientific article; zbMATH DE number 5909229 (Why is no real title available?)
- Bottleneck flows in unit capacity networks
- Improved bounds for bipartite matching on surfaces
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- On uniform \(k\)-partition problems
- Quadratic bottleneck problems
- Solution methods and computational investigations for the linear bottleneck assignment problem
- On the computational complexity of the bipartizing matching problem
- On bottleneck assignment problems under categorization.
- A note on the assignment problem with seniority and job priority constraints.
- Improved polynomial algorithms for robust bottleneck problems with interval data
- On a pair of job-machine assignment problems with two stages
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- An improved general procedure for lexicographic bottleneck problems
- Robust Factorizations and Colorings of Tensor Graphs
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
- Sensitivity analysis for bottleneck assignment problems
- A note on the parity assignment problem
- Linear assignment procedures
- Solving some lexicographic multi-objective combinatorial problems
- scientific article; zbMATH DE number 842126 (Why is no real title available?)
This page was built for publication: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337676)
