Relay placement for two-connectivity (Q2339829): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2014.06.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2074123869
@@ Property / OpenAlex ID: W2074123869 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3218772
@@ Property / cites work: Q3218772 / rank @@
+Normal rank
@@ Property / cites work @@
+Relay placement for fault tolerance in wireless networks in higher dimensions
+Normal rank
@@ Property / cites work @@
+Low-degree minimum spanning trees
@@ Property / cites work: Low-degree minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Low-degree minimal spanning trees in normed spaces
+Normal rank
@@ Property / cites work @@
+Biconnectivity approximations and graph carvings
@@ Property / cites work: Biconnectivity approximations and graph carvings / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Uniform Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Survivable networks, linear programming relaxations and the parsimonious property
+Normal rank
@@ Property / cites work @@
+Bounding component sizes of two-connected Steiner networks
+Normal rank
@@ Property / cites work @@
+Two-connected Steiner networks: structural properties
+Normal rank
@@ Property / cites work @@
+On the structure and complexity of the 2-connected Steiner network problem in the plane
+Normal rank
@@ Property / cites work @@
+An application of submodular flows
@@ Property / cites work: An application of submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Q4219046
@@ Property / cites work: Q4219046 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Survivable Networks with Minimum Number of Steiner Points
+Normal rank
@@ Property / cites work @@
+Steiner tree problem with minimum number of Steiner points and bounded edge-length
+Normal rank
@@ Property / cites work @@
+A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
+Normal rank
@@ Property / cites work @@
+Approximations for Steiner trees with minimum number of Steiner points
+Normal rank
@@ Property / cites work @@
+Wireless network design via 3-decompositions
@@ Property / cites work: Wireless network design via 3-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+A matroid approach to finding edge connectivity and packing arborescences
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-disjoint paths and edge-disjoint branchings in directed graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2339829