Constrained weighted matchings and edge coverings in graphs
- 1 June 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 92 (2-3), 229-241
- https://doi.org/10.1016/s0166-218x(99)00052-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Linear Assignment Problems and ExtensionsPublished by Springer Nature ,1999
- The k-cardinality assignment problemDiscrete Applied Mathematics, 1997
- Algorithms and codes for the assignment problemAnnals of Operations Research, 1988
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- Linear Assignment ProblemsPublished by Elsevier ,1987
- Equivalence between the minimum covering problem and the maximum matching problemDiscrete Mathematics, 1984
- A 1‐matching blossom‐type algorithm for edge covering problemsNetworks, 1982
- An efficient algorithm for minimumk-covers in weighted graphsMathematical Programming, 1975