Finding optimal non-datapath caching strategies via network flow (Q2682921): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2022.12.036
@@ Property / DOI: 10.1016/j.tcs.2022.12.036 / rank @@
-Normal rank
@@ 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.tcs.2022.12.036
+Normal rank
@@ Property / OpenAlex ID @@
+W4313478423
@@ Property / OpenAlex ID: W4313478423 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost flows by double scaling
@@ Property / cites work: Finding minimum-cost flows by double scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms
@@ Property / cites work: Combinatorial optimization. Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+A short proof of optimality for the MIN cache replacement algorithm
+Normal rank
@@ Property / cites work @@
+Network Flow Algorithms
@@ Property / cites work: Network Flow Algorithms / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2022.12.036
@@ Property / DOI: 10.1016/J.TCS.2022.12.036 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2682921