The following pages link to (Q5675543):
Displayed 50 items.
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- General factors of graphs (Q1085185) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Total unimodularity and the Euler-subgraph problem (Q1107442) (← links)
- An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
- A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
- On the diameter of the edge cover polytope (Q1115884) (← links)
- Forest covers and a polyhedral intersection theorem (Q1121807) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- On generalized matching problems (Q1149783) (← links)
- Another look at the degree constrained subgraph problem (Q1167739) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- A separation algorithm for the matchable set polytope (Q1334957) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- Rational and integral \(k\)-regular matrices. (Q1420582) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients (Q1669013) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- An identity for matching and skew-symmetric determinant (Q1805187) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- On structures of bisubmodular polyhedra (Q1814796) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- An identity for bipartite matching and symmetric determinant (Q1894478) (← links)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems (Q2052179) (← links)
- Oriented hypergraphs: balanceability (Q2124629) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals (Q2313415) (← links)
- On dual integrality in matching problems (Q2314407) (← links)
- Spectra of cycle and path families of oriented hypergraphs (Q2321360) (← links)