scientific article

zbMath0907.90268MaRDI QIDQ3840351

No author found.

Publication date: 10 August 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programming relaxationsalesman problem2-edge connected subgraph problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (10)

Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem ⋮ A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case ⋮ Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph ⋮ Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices ⋮ Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs ⋮ Shorter tours and longer detours: uniform covers and a bit beyond ⋮ The salesman's improved tours for fundamental classes ⋮ 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 ⋮ Unnamed Item ⋮ Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

This page was built for publication: