Author:
Haddadan Arash,Newman Alantha
Funder
Office of Naval Research Global
National Science Foundation
IDEX-IRS SACRE
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference34 articles.
1. Alexander, A., Boyd, S., Elliott-Magwood, P.: On the integrality gap of the 2-edge connected subgraph problem. Technical report, TR-2006-04, SITE, University of Ottawa (2006)
2. Boyd, S., Carr, R.: Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discrete Optim. 8(4), 525–539 (2011)
3. Boyd, S., Iwata, S., Takazawa, K.: Finding 2-factors closer to TSP tours in cubic graphs. SIAM J. Discrete Math. 27(2), 918–939 (2013)
4. Broersma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17, 259–269 (1995)
5. Boyd, S., Legault, P.: Toward a 6/5 bound for the minimum cost 2-edge connected spanning subgraph. SIAM J. Discrete Math. 31, 632–644 (2015)