Survivable network activation problems (Q386909): 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.tcs.2012.10.054
+Normal rank
@@ Property / OpenAlex ID @@
+W2122343760
@@ Property / OpenAlex ID: W2122343760 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum power edge-multi-covers
@@ Property / cites work: Approximating minimum power edge-multi-covers / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549695
@@ Property / cites work: Q3549695 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Rooted \(k\)-connections in digraphs
@@ Property / cites work: Rooted \(k\)-connections in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Power optimization for connectivity problems
@@ Property / cites work: Power optimization for connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+Approximating node connectivity problems via set covers
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs
+Normal rank
@@ Property / cites work @@
+On minimum power connectivity problems
@@ Property / cites work: On minimum power connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
+Normal rank
@@ Property / cites work @@
+A note on Rooted Survivable Networks
@@ Property / cites work: A note on Rooted Survivable Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum power covers of intersecting families and directed edge-connectivity problems
+Normal rank
@@ Property / cites work @@
+Approximating Steiner Networks with Node-Weights
@@ Property / cites work: Approximating Steiner Networks with Node-Weights / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating subset \(k\)-connectivity problems
@@ Property / cites work: Approximating subset \(k\)-connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365097
@@ Property / cites work: Q5365097 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:386909