Improved deterministic algorithms for weighted matching and packing problems (Q534565): Difference between revisions

@@ Property / cites work @@
+Using nondeterminism to design efficient deterministic algorithms
+Normal rank
@@ Property / cites work @@
+Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster fixed-parameter tractable algorithms for matching and packing problems
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient parameterized algorithm for m-set packing
+Normal rank
@@ Property / cites work @@
+A faster parameterized algorithm for set packing
@@ Property / cites work: A faster parameterized algorithm for set packing / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Algorithms for Weighted 3-Set Packing
+Normal rank
@@ Property / cites work @@
+An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank