Pages that link to "Item:Q1102297"
From MaRDI portal
The following pages link to A construction for binary matroids (Q1102297):
Displaying 16 items.
- A construction method of matroidal networks (Q362156) (← links)
- 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 (Q484552) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- The cocycle lattice of binary matroids (Q1260774) (← links)
- Axiomatizing simple binary matroids by their closed circuits (Q1324489) (← links)
- Computing girth and cogirth in perturbed graphic matroids (Q1747998) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- Master polytopes for cycles of binary matroids (Q1824625) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- A characterization of binary Eulerian matroids (Q1911871) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- (Q3128892) (← links)
- Some New Matroids on Graphs: Cut Sets and the Max Cut Problem (Q3768702) (← links)
- A new contraction technique with applications to congruency-constrained cuts (Q5918921) (← links)
