A 1-matching blossom-type algorithm for edge covering problems
We discuss an efficient primal‐dual algorithm for finding a minimum cost edge cover in an undirected network G with n nodes and m edges, which is based on the blossom algorithm for 1‐matching problems. We establish that its worst case computational complexity is O(n3), the same as that for blossom o...
Gespeichert in:
| Veröffentlicht in: | Networks 1982, Vol.12 (4), p.379-391 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We discuss an efficient primal‐dual algorithm for finding a minimum cost edge cover in an undirected network G with n nodes and m edges, which is based on the blossom algorithm for 1‐matching problems. We establish that its worst case computational complexity is O(n3), the same as that for blossom or primal algorithms for 1‐matching problems. |
|---|---|
| ISSN: | 0028-3045 1097-0037 |
| DOI: | 10.1002/net.3230120403 |