Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem
Given a complete graph K_n = (V,E) with non-negative edge costs c ∈ R^E, the problem multi-2EC_cost is that of finding a 2-edge connected spanning multi-subgraph of K_n with minimum cost. It is believed that there are no efficient ways to solve the problem exactly, as it is NP-hard. Methods such as...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/36202 http://dx.doi.org/10.20381/ruor-20482 |