Cargando…
Computing the sequence of k-cardinality assignments
The k-cardinality assignment (k-assignment, for short) problem asks for finding a minimal (maximal) weight of a matching of cardinality k in a weighted bipartite graph [Formula: see text] , [Formula: see text] . Here we are interested in computing the sequence of all k-assignments, [Formula: see tex...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9375768/ https://www.ncbi.nlm.nih.gov/pubmed/35979402 http://dx.doi.org/10.1007/s10878-022-00889-4 |