Approximating the Minimum Chain Completion problem (Q989547): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.05.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2005576669
@@ Property / OpenAlex ID: W2005576669 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
+Normal rank
@@ Property / cites work @@
+Critical Load Factors in Two-Processor Distributed Systems
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank