On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-018-0292-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2800048262
@@ Property / OpenAlex ID: W2800048262 / rank @@
+Normal rank
@@ Property / cites work @@
+Empirical analysis of algorithms for the shortest negative cost cycle problem
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4943600
@@ Property / cites work: Q4943600 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized algorithms for finding the shortest negative cost cycle in networks
+Normal rank
@@ Property / cites work @@
+Optimal length resolution refutations of difference constraint systems
+Normal rank
@@ Property / cites work @@
+Improved algorithms for optimal length resolution refutation in difference constraint systems
+Normal rank