A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603): Difference between revisions

@@ label / en / label / en @@
+A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03889
@@ Property / arXiv ID: 1611.03889 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250161
@@ Property / cites work: Q4250161 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
+Normal rank
@@ Property / cites work @@
+The knapsack problem with neighbour constraints
@@ Property / cites work: The knapsack problem with neighbour constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934724
@@ Property / cites work: Q2934724 / rank @@
+Normal rank
@@ Property / cites work @@
+The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
+Normal rank
@@ Property / cites work @@
+The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             log             <i>n</i>             ) approximation scheme for Steiner tree in planar graphs
+Normal rank
@@ Property / cites work @@
+Q4219046
@@ Property / cites work: Q4219046 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252299
@@ Property / cites work: Q4252299 / rank @@
+Normal rank
@@ Property / cites work @@
+Send-and-Split Method for Minimum-Concave-Cost Network Flows
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Several Graph Augmentation Problems
+Normal rank
@@ Property / cites work @@
+Removable edges in 3-connected graphs
@@ Property / cites work: Removable edges in 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Biconnectivity approximations and graph carvings
@@ Property / cites work: Biconnectivity approximations and graph carvings / rank @@
+Normal rank
@@ Property / cites work @@
+A subset spanner for Planar graphs, with application to subset TSP
+Normal rank
@@ Property / cites work @@
+A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
+Normal rank
@@ Property / cites work @@
+Q3453397
@@ Property / cites work: Q3453397 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234131
@@ Property / cites work: Q4234131 / rank @@
+Normal rank
@@ Property / cites work @@
+Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
+Normal rank
@@ Property / OpenAlex ID @@
+W2749358524
@@ Property / OpenAlex ID: W2749358524 / rank @@
+Normal rank
@@ Property / title @@
+A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (English)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5002603