scientific article
From MaRDI portal
Publication:3840352
zbMath0909.90262MaRDI QIDQ3840352
András Sebő, Zoltán Szigeti, Joseph Cheriyan
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (3)
Finding 2-edge connected spanning subgraphs. ⋮ Approximating minimum size \{1,2\}-connected networks ⋮ An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
This page was built for publication:
