Strongly connected spanning subgraph for almost symmetric networks
DOI10.1142/S0218195917500042zbMATH Open1423.68529OpenAlexW2790408044MaRDI QIDQ3132920FDOQ3132920
Authors: A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur 
Publication date: 31 January 2018
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195917500042
Recommendations
- Approximating the minimum strongly connected subgraph via a matching lower bound
- Min-power strong connectivity
- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs
- Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
- Finding sparser directed spanners
computational geometryapproximation algorithms\(t\)-spannersstrongly connected subgraphssymmetric disk graphs
Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
- Approximating the minimum strongly connected subgraph via a matching lower bound
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Title not available (Why is that?)
- P-Complete Approximation Problems
- Biconnectivity approximations and graph carvings
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Augmentation Problems
- Approximating the Minimum Equivalent Digraph
- Approximation Algorithms for Several Graph Augmentation Problems
- On strongly connected digraphs with bounded cycle length
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Strongly connected spanning subgraph for almost symmetric networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132920)
