Minimizing maximum weight of subsets of a maximum matching in a bipartite graph

Maksim Barketau, Erwin Pesch, Yakov M. Shafransky. Minimizing maximum weight of subsets of a maximum matching in a bipartite graph. Discrete Applied Mathematics, 196:4-19, 2015. [doi]

@article{BarketauPS15,
  title = {Minimizing maximum weight of subsets of a maximum matching in a bipartite graph},
  author = {Maksim Barketau and Erwin Pesch and Yakov M. Shafransky},
  year = {2015},
  doi = {10.1016/j.dam.2015.01.008},
  url = {http://dx.doi.org/10.1016/j.dam.2015.01.008},
  researchr = {https://researchr.org/publication/BarketauPS15},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {196},
  pages = {4-19},
}