A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963791077
@@ Property / OpenAlex ID: W2963791077 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00936
@@ Property / arXiv ID: 1807.00936 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002828
@@ Property / cites work: Q3002828 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549697
@@ Property / cites work: Q3549697 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Resistance from Pairwise-Independent Subgroups
+Normal rank
@@ Property / cites work @@
+Q3165953
@@ Property / cites work: Q3165953 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2913818
@@ Property / cites work: Q2913818 / rank @@
+Normal rank
@@ Property / cites work @@
+A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests
+Normal rank
@@ Property / cites work @@
+Approximating Rooted Steiner Networks
@@ Property / cites work: Approximating Rooted Steiner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms and Hardness of the             <i>k</i>             -Route Cut Problem
+Normal rank
@@ Property / cites work @@
+Q4993301
@@ Property / cites work: Q4993301 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of non-boolean 2CSP
@@ Property / cites work: Approximation of non-boolean 2CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Q3191598
@@ Property / cites work: Q3191598 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Q2941638
@@ Property / cites work: Q2941638 / rank @@
+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-cost connectivity problems via uncrossable bifamilies
+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:1730018