Online variable sized covering (Q1854485): Difference between revisions

@@ Property / DOI @@
-.1006/inco.2001.3087
@@ Property / DOI: 10.1006/inco.2001.3087 / 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.1006/inco.2001.3087
+Normal rank
@@ Property / OpenAlex ID @@
+W2046642776
@@ Property / OpenAlex ID: W2046642776 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line and off-line approximation algorithms for vector covering problems
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of algorithms for dual bin packing problems
+Normal rank
@@ Property / cites work @@
+Online algorithms for a dual version of bin packing
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal on-line algorithms for variable-sized bin covering
+Normal rank
@@ Property / DOI @@
+.1006/INCO.2001.3087
@@ Property / DOI: 10.1006/INCO.2001.3087 / rank @@
+Normal rank