Approximability of Capacitated Network Design (Q3009752): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2568450825
@@ Property / OpenAlex ID: W2568450825 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-Cost Network Design with (Dis)economies of Scale
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Q4527000
@@ Property / cites work: Q4527000 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of capacitated network design
@@ Property / cites work: Approximability of capacitated network design / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934722
@@ Property / cites work: Q2934722 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921762
@@ Property / cites work: Q2921762 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
+Normal rank
@@ Property / cites work @@
+Q5501842
@@ Property / cites work: Q5501842 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Q3128880
@@ Property / cites work: Q3128880 / rank @@
+Normal rank
@@ Property / cites work @@
+Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
+Normal rank
@@ Property / cites work @@
+A Parallel Repetition Theorem
@@ Property / cites work: A Parallel Repetition Theorem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3009752