Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043): Difference between revisions

@@ Property / DOI @@
-.1016/j.orl.2010.09.004
@@ Property / DOI: 10.1016/j.orl.2010.09.004 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2042788891
@@ Property / OpenAlex ID: W2042788891 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2249
@@ Property / arXiv ID: 1006.2249 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved LP-based approximation for steiner tree
+Normal rank
@@ Property / cites work @@
+Hypergraphic LP Relaxations for Steiner Trees
@@ Property / cites work: Hypergraphic LP Relaxations for Steiner Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and the greedy algorithm
@@ Property / cites work: Matroids and the greedy algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner trees and minimum spanning trees in hypergraphs
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for Graph Steiner Tree Approximation
+Normal rank
@@ Property / cites work @@
+Q3330973
@@ Property / cites work: Q3330973 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4395337
@@ Property / cites work: Q4395337 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ORL.2010.09.004
@@ Property / DOI: 10.1016/J.ORL.2010.09.004 / rank @@
+Normal rank