scientific article; zbMATH DE number 1833404
From MaRDI portal
Publication:4780785
zbMath1001.05113MaRDI QIDQ4780785
Jon Feldman, Guy Even, Zeev Nutov, Guy Kortsarz
Publication date: 21 November 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2129/21290090
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
On the tree augmentation problem ⋮ A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) ⋮ A unified approach to approximating partial covering problems ⋮ LP-relaxations for tree augmentation ⋮ Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP ⋮ On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality ⋮ Covering a laminar family by leaf to leaf links ⋮ Unnamed Item ⋮ Path hitting in acyclic graphs ⋮ Vertex covering by paths on trees with its applications in machine translation
This page was built for publication:
