Strongly Connected Spanning Subgraph for Almost Symmetric Networks
DOI10.1142/S0218195917500042zbMath1423.68529OpenAlexW2790408044MaRDI QIDQ3132920
Anat Parush Tzur, A. Karim Abu-Affash, Paz Carmi
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
computational geometryapproximation algorithms\(t\)-spannersstrongly connected subgraphssymmetric disk graphs
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- On strongly connected digraphs with bounded cycle length
- Approximation Algorithms for Several Graph Augmentation Problems
- Augmentation Problems
- P-Complete Approximation Problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Biconnectivity approximations and graph carvings
- Approximating the Minimum Equivalent Digraph
This page was built for publication: Strongly Connected Spanning Subgraph for Almost Symmetric Networks
