Pages that link to "Item:Q2848544"

The following pages link to Finding 2-Factors Closer to TSP Tours in Cubic Graphs (Q2848544):

Displaying 12 items.

• A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
• A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
• The parity Hamiltonian cycle problem (Q1690220) (← links)
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
• Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
• Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
• The salesman's improved tours for fundamental classes (Q2227538) (← links)
• Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
• Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
• Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
• The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
• Synchronized Traveling Salesman Problem (Q5084688) (← links)