On tree-constrained matchings and generalizations (Q2258075): Difference between revisions

@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Scheduling Split Intervals
@@ Property / cites work: Scheduling Split Intervals / rank @@
+Normal rank
@@ Property / cites work @@
+On Tree-Constrained Matchings and Generalizations
@@ Property / cites work: On Tree-Constrained Matchings and Generalizations / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating spanners
@@ Property / cites work: On the hardness of approximating spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative Methods in Combinatorial Optimization
@@ Property / cites work: Iterative Methods in Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4943600
@@ Property / cites work: Q4943600 / rank @@
+Normal rank
@@ Property / cites work @@
+Elimination graphs
@@ Property / cites work: Elimination graphs / rank @@
+Normal rank