Finding 2-Factors Closer to TSP Tours in Cubic Graphs
暂无分享,去创建一个
[1] Prosenjit Bose,et al. Efficient algorithms for Petersen's matching theorem , 1999, SODA '99.
[2] Moshe Lewenstein,et al. An improved upper bound for the TSP in cubic 3-edge-connected graphs , 2005, Oper. Res. Lett..
[3] Gérard Cornuéjols,et al. The traveling salesman problem in graphs with 3-edge cutsets , 1985, JACM.
[4] László A. Végh,et al. Restricted b-Matchings in Degree-Bounded Graphs , 2010, IPCO.
[5] Paul Elliott-Magwood,et al. On the Integrality Gap of the 2-Edge Connected Subgraph Problem ∗ , 2006 .
[6] Zoltán Szigeti,et al. Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph , 2001, SIAM J. Discret. Math..
[7] Paul G. Spirakis,et al. Graph Properties that Facilitate Travelling , 1998, Electron. Colloquium Comput. Complex..
[8] Yanjun Li,et al. Maximum Cardinality Simple 2-matchings in Subcubic Graphs , 2011, SIAM J. Optim..
[9] Santosh S. Vempala,et al. Factor 4/3 approximations for minimum 2-connected subgraphs , 2000, APPROX.
[10] Yanjun Li,et al. Polyhedron of triangle-free simple 2-matchings in subcubic graphs , 2013, Math. Program..
[11] Yusuke Kobayashi,et al. A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs , 2010, Discret. Optim..
[12] Jens Vygen,et al. Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs , 2012, ArXiv.
[13] Woonghee Tim Huh,et al. Finding 2-edge connected spanning subgraphs , 2004, Oper. Res. Lett..
[14] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[15] Daniel Král,et al. Unions of perfect matchings in cubic graphs , 2005, Electron. Notes Discret. Math..
[16] Piotr Krysta,et al. Approximation Algorithms for Minimum Size 2-Connectivity Problems , 2001, STACS.
[17] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[18] David R. Karger,et al. Finding maximum flows in undirected graphs seems easier than bipartite matching , 1998, STOC '98.
[19] Marek Karpinski,et al. Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems , 2002, SODA '02.
[20] Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.
[21] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[23] Riste Skrekovski,et al. Cycles Intersecting Edge-Cuts of Prescribed Sizes , 2008, SIAM J. Discret. Math..
[24] Balaji Raghavachari,et al. A 5/4-approximation algorithm for minimum 2-edge-connectivity , 2003, SODA '03.