On the constrained Steiner strong connectivity augmentation problem

DOI10.1007/978-981-96-4445-2_13MaRDI QIDQ6909246zbMATH OpenFDO

Authors Junran Lichen, Shuwen Ge, Runtao Xie, Ping Yang

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_13

zbMATH Keywords

approximation algorithmscombinatorial optimizationcomplexityconstrained Steiner strong connectivity augmentationconstrained strong connectivity augmentation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
• A good algorithm for edge-disjoint branching
• An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
• Approximation Algorithms for Directed Steiner Problems
• Approximation Algorithms for Graph Augmentation
• Approximation Algorithms for Several Graph Augmentation Problems
• Augmentation Problems
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Combinatorial optimization. Theory and algorithms
• How to Secure Matchings against Edge Failures
• scientific article; zbMATH DE number 3827200 (Why is no real title available?)
• Smallest Augmentations to Biconnect a Graph
• Steiner tree approximation via iterative randomized rounding
• Strong connectivity in directed graphs under failures, with applications
• The Steiner problem with edge lengths 1 and 2
• Tighter Bounds for Graph Steiner Tree Approximation

This page was built for publication: On the constrained Steiner strong connectivity augmentation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909246)