Approximating Minimum Cost Connectivity Orientation and Augmentation

DOI10.1137/15100583XMaRDI QIDQ4606698zbMATH OpenWikidataFDO

Authors Mohit Singh, László A. Végh

Publication date 9 March 2018

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/15100583X

zbMATH Keywords

approximation algorithmsgraph algorithmsgraph connectivitygraph orientation

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximating minimum cost connectivity orientation and augmentation
• Improved approximation algorithms for min-cost connectivity augmentation problems
• Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
• Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
• Approximating connectivity augmentation problems
• Approximating connectivity augmentation problems
• An algorithm for minimum cost arc-connectivity orientations
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems
• scientific article; zbMATH DE number 1263261
• Approximation algorithms for connectivity augmentation problems

Cites work

• A factor 2 approximation algorithm for the generalized Steiner network problem
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Biconnectivity approximations and graph carvings
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combined connectivity augmentation and orientation problems
• Connections in combinatorial optimization
• Directed Network Design with Orientation Constraints
• Edge-connectivity augmentation problems
• scientific article; zbMATH DE number 1670542 (Why is no real title available?)
• scientific article; zbMATH DE number 1146228 (Why is no real title available?)
• Iterative methods in combinatorial optimization.
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On the orientation of graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Robbins's Theorem for Mixed Multigraphs
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(7)

• Combined connectivity augmentation and orientation problems
• Primal-dual approach for directed vertex connectivity augmentation and generalizations
• scientific article; zbMATH DE number 1757953 (Why is no real title available?)
• Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
• Approximating minimum cost connectivity orientation and augmentation
• Minimum cost nowhere-zero flows and cut-balanced orientations
• An algorithm for minimum cost arc-connectivity orientations

This page was built for publication: Approximating Minimum Cost Connectivity Orientation and Augmentation

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