A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6239363
@@ Property / zbMATH DE Number: 6239363 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tree augmentation
@@ Property / zbMATH Keywords: tree augmentation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge-connectivity
@@ Property / zbMATH Keywords: edge-connectivity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+laminar family
@@ Property / zbMATH Keywords: laminar family / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+local replacement
@@ Property / zbMATH Keywords: local replacement / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ 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.tcs.2013.04.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2326678228
@@ Property / OpenAlex ID: W2326678228 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:388116