scientific article; zbMATH DE number 2119646
From MaRDI portal
Publication:4828917
zbMath1093.68677MaRDI QIDQ4828917
Béla Csaba, Piotr Krysta, Marek Karpinski
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs ⋮ A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges ⋮ Approximation hardness of graphic TSP on cubic graphs ⋮ A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs ⋮ Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph ⋮ A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem ⋮ The traveling salesman problem on cubic and subcubic graphs ⋮ Approximation bounds for Black Hole Search problems ⋮ The path partition problem and related problems in bipartite graphs ⋮ TSP on Cubic and Subcubic Graphs ⋮ Strongly Connected Spanning Subgraph for Almost Symmetric Networks
This page was built for publication:
