Covering a laminar family by leaf to leaf links
type: Item
instance of: scholarly article
title: Covering a laminar family by leaf to leaf links
zbMATH Open document ID: 1209.05049
author: Yael Maduel
author: Zeev Nutov
published in: Discrete Applied Mathematics
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5770516
zbMATH Keywords: edge-connectivity
zbMATH Keywords: approximation algorithm
zbMATH Keywords: laminar family
zbMATH Keywords: edge-cover
zbMATH Keywords: best approximation ratio
MaRDI profile type: Publication
full work available at URL: j.dam.2010.04.002
OpenAlex ID: W1978176066
cites work: Q4938792
cites work: On the integrality ratio for tree augmentation
cites work: Q4780785
cites work: A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
cites work: A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
cites work: On the relationship between the biconnectivity augmentation and traveling salesman problems
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
DOI: 10.1016/J.DAM.2010.04.002
description: scientific article; zbMATH DE number 5770516