scientific article
From MaRDI portal
Publication:2753746
zbMath0976.90114MaRDI QIDQ2753746
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (11)
A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges ⋮ Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges ⋮ A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem ⋮ The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm ⋮ Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks ⋮ On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks ⋮ Computing the 2-blocks of directed graphs ⋮ Strongly Connected Spanning Subgraph for Almost Symmetric Networks ⋮ Approximating minimum size \{1,2\}-connected networks
This page was built for publication:
