A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Equivalent Digraph
@@ Property / cites work: Approximating the Minimum Equivalent Digraph / rank @@
+Normal rank
@@ Property / cites work @@
+On strongly connected digraphs with bounded cycle length
+Normal rank
@@ Property / cites work @@
+Q2768327
@@ Property / cites work: Q2768327 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1007574