Constrained weighted matchings and edge coverings in graphs

Discrete Applied Mathematics

Volumn 92, Issue 2-3, 1999, Pages 229-241

  Plesník, Ján ^a  

^a Matematicko fyzikalna Fakulta U   (Slovakia)

Author keywords

Assignment problem; Constrained weighted edge cover; Constrained weighted matching; Graph

Indexed keywords

EID: 0042942346     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00052-9     Document Type: Article

References (12)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. R.E. Burkard, E. Cela, Linear assignment problems and extensions, in: P. Pardalos, D.-Z. Du (Eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht, to appear.
3. G. Carpaneto, S. Martello, P. Toth, Algorithms and codes for the assignment problem, in: B. Simeone et al. (Eds.), Fortran Codes for Network Optimization, Annals of Operations Research, vol. 13, J.C. Baltzer AG, Basel, 1988, pp. 125-190.
4. M. Dell'Amico, S. Martello, The k-cardinality assignment problem, Discrete Appl. Math. 76 (1997) 103-121.
5. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
6. R. Jonker, T. Volgenant, A shortest augmenting path algorithms for dense and sparse linear assignment problems, Computing 38 (1987) 325-340.
7. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
8. L. Lovász, M.D. Plummer, Matching Theory, North-Holland, Amsterdam, 1986.
9. S. Martello, P. Toth, Linear assignment problems, in: S. Martello et al. (Eds.), Surveys in Combinatorial Optimization, Annals of Discrete Mathematics, vol. 31, North-Holland, Amsterdam, 1987, pp. 259-282.
10. K.G. Murty, C. Perin, A 1-matching blossom-type algorithm for edge covering problems, Networks 12 (1982) 379-391.
11. J. Plesník, Equivalence between the minimum covering problem and the maximum matching problem, Discrete Math. 49 (1984) 315-317.
12. L.J. White, M.L. Gillenson, An efficient algorithm for minimum k-covers in weighted graphs, Math. Program. 8 (1975) 20-42.